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

In how many ways can a committee of 5 senators be selected from the 100 members of the U.S. Senate so that no two committee members are from the same state?

OpenStudy (anonymous):

This is a bit tricky to do unless you know the number of senators per state. I think that states have 2 senators per state. Then we would have C(50,5). This is to say we would have 50 senators available and are choosing 2. I think this is right. It's been a while since I did combinatorics. Hope this helps. Thanks, Sean Walsh Facebook: Tutor Sean http://www.tutorsean.net

OpenStudy (anonymous):

it's not the answer. But thans for trying.

OpenStudy (anonymous):

Did you find the answer? This is a really tricky type of problem. There is an entire discipline devoted to this called Combinatorics.

OpenStudy (anonymous):

the answer sheet says 67800320

OpenStudy (anonymous):

Yeah, my answer of 50 choose 5 would have been 2,118,760. There are many formulas for these problems, and my course was a survey course. Sorry I wasn't able to help.

OpenStudy (anonymous):

its okay.

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!