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

In how many ways can Troy select nine marbles from a bag of twelve, identical except for color, where three are red, three blue, three white, and three green.

OpenStudy (anonymous):

Combinations without repetition (n=12, r=9) C (n,r)= n!/r!(n-r)! =12!/9!(12-9)! = 220 ---> That was solved with a scientific calcuator. 220 entries. = Troy has 220 ways to select nine marbles from a bag of twelve.

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!