My daughter has started a zoo on our refrigerator door. She has 20 animals, and wants to put them in cages, with an equal number of animals in each cage. (She's not concerned about some animals eating others; she assures me they're all vegetarians.) Which arrangement will afford her the greatest number of possible groupings of the animals?
Assume that the cages themselves are indistinguishable. So the same grouping of animals placed in different cages would not be considered a different grouping.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Reading with understanding. I thought that it was meant to have the biggest ammount of animals per cage. -_-
Matt, how did you arrive at ( ( k n ) ! ) k ?
Log in to reply
I think it might be easiest to use specific values, rather than n and k . Then you might see how it would generalize.
Suppose we want to count the number of ways to divide 20 animals into five cages, with four animals in each cage. We have the 20 animals in front of us. How many ways can we choose four animals for our first cage? ( 4 2 0 ) . Then, to make our second cage, we choose 4 animals from the 16 remaining, and there are ( 4 1 6 ) ways to do that. Then there are 12 animals remaining from which to make the third cage... and so on. So at first the answer appears to be
( 4 2 0 ) ( 4 1 6 ) ( 4 1 2 ) ( 4 8 ) ( 4 4 ) .
I'll simplify this expression first, then explain why it's not complete. The above expression simplifies to
1 6 ! 4 ! 2 0 ! 1 2 ! 4 ! 1 6 ! 8 ! 4 ! 1 2 ! 4 ! 4 ! 8 ! 0 ! 4 ! 4 ! ,
which you can see reduces to ( 4 ! ) 5 2 0 ! .
But we have over-counted! We're assuming the cages are identical, so our taking into account the order in which we made each cage resulted in our counting each distinct grouping 5 ! = 1 2 0 times (the number of ways you could order the five cages). So we then need to divide our result by 5 ! :
( 4 ! ) 5 5 ! 2 0 !
So to answer your original question, the ( ( k n ) ! ) k in this example is the ( 4 ! ) 5 . I hope this helped!
what does ! sign mean dude ?
Log in to reply
For any positive integer n ,
n ! : = n ( n − 1 ) ( n − 2 ) ( n − 3 ) … 3 ⋅ 2 ⋅ 1 .
that is factorial
yay ! i solved it :)
dont we need to arrange groups in cages by multiplying with k!
guess
Nice one! I have a same problem about this, but for k = 2.
My problem will become easy for now. *sobs
Can Cinderella avoid dancing with her stepfamily?
very good answer sir matt enlow
(y)
Well...I assumed the cages to be different as nothing about it was mentioned about it...through that you get the answer to be 2 animals in 10 cages ...is that right??
Log in to reply
Yes, if the cages are distinguishable from each other, then the correct answer would be 10 cages, 2 animals per cage. (I added a clarification to the problem--Thank you!)
Log in to reply
You r welcome...thanx for clearing it up anyway!!
Yea.. I did that too.. I attempted 2 animals, 10 cages. :/ but I understand the mistake now.
Problem Loading...
Note Loading...
Set Loading...
The number of ways that n objects can be split into k groups of k n objects each is
( ( k n ) ! ) k k ! n ! .
So the question boils down to which of the following is greatest:
( 1 0 ! ) 2 2 ! 2 0 ! , ( 5 ! ) 4 4 ! 2 0 ! , ( 4 ! ) 5 5 ! 2 0 ! , ( 2 ! ) 1 0 1 0 ! 2 0 ! .
Equivalently, we just need to determine which of
( 1 0 ! ) 2 2 ! , ( 5 ! ) 4 4 ! , ( 4 ! ) 5 5 ! , ( 2 ! ) 1 0 1 0 !
is the least. So to do this, we'll compare them in pairs, then compare the lesser of each pair. Since
( 5 ! ) 4 4 ! ( 4 ! ) 5 5 ! = 5 ! 5 ! 5 ! 5 ! 4 ! 4 ! 4 ! 4 ! 4 ! 4 ! 5 ! = 5 3 4 ! = 1 2 5 2 4 ,
this tells us that ( 4 ! ) 5 5 ! < ( 5 ! ) 4 4 ! . And since
( 1 0 ! ) 2 2 ! ( 2 ! ) 1 0 1 0 ! = 1 0 ! 2 9 = 1 0 ⋅ 9 ⋅ 8 ⋅ 7 ⋅ 6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 2 ⋅ 2 ⋅ 2 ⋅ 2 ⋅ 2 ⋅ 2 ⋅ 2 ⋅ 2 ⋅ 2 ,
it's clear that ( 2 ! ) 1 0 1 0 ! < ( 1 0 ! ) 2 2 ! . Now for the finals!
( 2 ! ) 1 0 1 0 ! ( 4 ! ) 5 5 ! = 2 5 2 5 1 0 ! 4 5 3 5 2 5 1 5 5 ! = 1 0 ! 2 5 3 5 5 ! = 1 0 ⋅ 9 ⋅ 8 ⋅ 7 ⋅ 6 6 ⋅ 6 ⋅ 6 ⋅ 6 ⋅ 6 ,
so ( 4 ! ) 5 5 ! is the least, which means that ( 4 ! ) 5 5 ! 2 0 ! is the greatest. So the answer is Five cages, 4 animals per cage .