Geometric progressions

Algebra Level 4

99 infinitely long lines of people approach a pile of 1000000 cakes.

In the first line of people, the first person eats 1 3 \frac{1}{3} of the cakes, the second person eats 1 3 \frac{1}{3} of what the first person of the first line ate, the third person eats 1 3 \frac{1}{3} of what the second person ate, and so on. After the first line has passed, the first person of the second line eats 1 4 \frac{1}{4} of the remaining cakes, and the second person eats 1 4 \frac{1}{4} 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.


The answer is 2018.

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

Guilherme Niedu
Jan 30, 2017

The n t h n^{th} line eats 1 n + 2 \large \frac{1}{n+2} of what the previous person ate. So, the line n t h n^{th} will eat 1 n + 2 + 1 ( n + 2 ) 2 + 1 ( n + 2 ) 3 + . . . = 1 n + 1 \large \frac{1}{n+2} + \frac{1}{(n+2)^2} + \frac{1}{(n+2)^3} + ... = \frac{1}{n+1} of the cake.

The total of cakes after the 99 lines passed the total of cakes will be:

1000000 ( 1 1 2 ) ( 1 1 3 ) ( 1 1 4 ) . . . ( 1 1 100 ) \large 1000000 \cdot (1 - \frac{1}{2}) \cdot (1 - \frac{1}{3}) \cdot (1 - \frac{1}{4}) \cdot ... \cdot (1 - \frac{1}{100})

= 1000000 1 2 2 3 3 4 . . . 99 100 \large = 1000000 \cdot \frac{1}{2} \cdot \frac{2}{3} \cdot \frac{3}{4} \cdot ... \cdot \cdot \frac{99}{100}

Each denominator will cancel out with the following numerator, remaining only the first numerator and the last denominator, or:

= 1000000 1 100 = 10000 \large = 1000000 \cdot \frac{1}{100} = 10000

Take out the 7982 7982 cakes and 2018 \color{#3D99F6} \fbox{2018} cakes remain.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...