6 (indistinguishable) people get on to an empty bus as it begins its route, and no one else boards the bus once it has set off. There are 10 (distinguishable) stops where the passengers may get off the bus. When the bus reaches the end of the line it must be empty. Let n be the number of ways that the passengers can leave the bus. What is the sum of the digits of n ?
It is the number of people that get off at each of the 10 stops which matters, not who the people are who get off
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.
Let,
Number of people who get off at Stop 1 = x 1
Number of people who get off at Stop 2 = x 2
⋮
Number of people who get off at Stop 10 = x 1 0
It is clear that,
x 1 + x 2 + … + x 1 0 = 6
where, x 1 , x 2 , … , x 1 0 ≥ 0
Thus, the number of integral solutions to this equation are,
( 1 0 − 1 6 + 1 0 − 1 ) = ( 9 1 5 ) = 5 0 0 5
Hence, the digit sum of 5 0 0 5 is,
5 + 0 + 0 + 5 = 1 0