Ask your own question, for FREE!
Mathematics 9 Online
OpenStudy (anonymous):

IM KINDA FRUSTRATED WITH THIS PROPLEM HELP MEEEEEEEEEEEEEEEEEEEEEEEEEE!!!!!!!!!!! Louis lucas garcelle and Sheryl go bowling every week. when ordered from highest to lowest how many ways can their scores be arranged if lucas is never first and garcelle always beats louis

OpenStudy (anonymous):

|dw:1400195674480:dw|

OpenStudy (anonymous):

I got 12

OpenStudy (anonymous):

We know that louis and lucas can never be in first position. So there are two choices for first position. We know that garcelle can never be in last position. So there are three choices for fourth position. There are four possible choices each for second and third position. However, this option is not allowed, Sheryl, louis, garcelle, lucas So I'm thinking that if we use the fundamental counting principle and subtract the one option that is not allowed, we should get a correct answer. So it looks like you have (2x4x4x3)-1= 95 That's my best shot at it.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!