by JonathanSchneider Thu Nov 13, 2008 12:50 am
Hey Hassan,
Thanks for your patience. We are finally catching up in our responses.
So, the way to look at this problem is this:
We've got 20 items. These can be arranged in 20! different ways. (Proof: fo the first item, we have 20 choices, for the second item we have 19 choices, etc.)
However, some of these items are the same. That is, those items can be rearranged among the same spaces on the shelf, and the overall composition will not change. Specifically, in this instance, let's say that we have five books: A, B, C, D, and E. Now, we have four copies of book A. We can write this out AAAA. Switch around those letters and you still get the same result. How many ways are there to shuffle those four letters? Well, 4!, of course (just like the 20! ways to shuffle 20 items). So, we must divide the 20! by 4!, to eliminate all of the "recounts" of the arrangements that are essentially the same.
Of course, the same is true of the other copies of the other books: for each book we have four copies, and so for each book we must divide by 4!.
The Anagram Grid can easily represent this math:
A B C D E F G H I J K L M N O P Q R S T
A A A A B B B B C C C C D D D D E E E E
We write it this way because we have four copies each of the five different books. We now group the similar symbols on the bottom into factorials, with the total # of slots on the top as its own factorial in the numerator:
20! / (4! 4! 4! 4! 4!)
Clear?