Piling camels (piling in bins 1/4)

In the board game Camel Up , there are 5 different camels to play with and there are 16 squares on the board on which the camels can stay. Whenever there are more than one camel on the same square, they are put one on top of another, forming a pile that can be 5 camels tall! The last camel to arrive is put on top and this order is very important.

How many ways are there to dispose the 5 camels on the 16 squares?


Part of the Piling distinct objects in bins set.


The answer is 1860480.

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.

1 solution

Laurent Shorts
Feb 5, 2017

If the camels were all identical, piling them or not wouldn't change the number of ways to do it, and that would be ( ( 16 5 ) ) = ( 20 5 ) = 1 5 504 \Big(\!\!{16 \choose 5}\!\!\Big)={20 \choose 5}=15'504 . Now, each camel has a distinct position, so if we want to paint them with 5 colors, there is 5 ! = 120 5!=120 ways to do it.

Answer is then ( ( 16 5 ) ) 5 ! = 1 5 504 120 = 1 86 0 480 \Big(\!\!{16 \choose 5}\!\!\Big) · 5! = 15'504·120 = \boxed{1'860'480} .


( ( n k ) ) \Big(\!\!{n \choose k}\!\!\Big) is the number of ways to choose one of n n elements k k times, without order, with possibility to choose the same element several times. That is the number of ways to place k k indistinguishable balls into n n labeled urns.

( ( n k ) ) = ( n + k 1 k ) \Big(\!\!{n \choose k}\!\!\Big)={n+k-1 \choose k} See stars and bars .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...