99 infinitely long lines of people approach a pile of 1000000 cakes.
In the first line of people, the first person eats of the cakes, the second person eats of what the first person of the first line ate, the third person eats of what the second person ate, and so on. After the first line has passed, the first person of the second line eats of the remaining cakes, and the second person eats of what the first person of the second line ate, and so on. After all the lines have passed, a greedy person eats 7982 cakes. How many cakes remain?
Note: people are allowed to eat fractions of cakes.
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.
The n t h line eats n + 2 1 of what the previous person ate. So, the line n t h will eat n + 2 1 + ( n + 2 ) 2 1 + ( n + 2 ) 3 1 + . . . = n + 1 1 of the cake.
The total of cakes after the 99 lines passed the total of cakes will be:
1 0 0 0 0 0 0 ⋅ ( 1 − 2 1 ) ⋅ ( 1 − 3 1 ) ⋅ ( 1 − 4 1 ) ⋅ . . . ⋅ ( 1 − 1 0 0 1 )
= 1 0 0 0 0 0 0 ⋅ 2 1 ⋅ 3 2 ⋅ 4 3 ⋅ . . . ⋅ ⋅ 1 0 0 9 9
Each denominator will cancel out with the following numerator, remaining only the first numerator and the last denominator, or:
= 1 0 0 0 0 0 0 ⋅ 1 0 0 1 = 1 0 0 0 0
Take out the 7 9 8 2 cakes and 2 0 1 8 cakes remain.