At a party, there are 99 guests and the host himself.
The host wants to eat the most pie, and he knows that he has to sit in a particular seat to achieve this. The order of giving out the pie is as follows: The first guest gets 1% of the pie, the second guest gets 2% of the remaining pie, the 3rd guest gets 3% of the remaining pie, and so on, until the last guest gets 100% of the leftover pie.
So in which seat will he receive the most pie?
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 G n be the partition of pie that n t h person get, F n be the remaining Pie after n t h person get their pie.
F n = 1 0 0 1 0 0 − n ⋅ F n − 1 ( 1 ) G n = 1 0 0 n ⋅ F n − 1 ( 2 ) Rearrange (1),
F n − 1 = 1 0 0 − n 1 0 0 ⋅ F n ( 3 )
Compare G n + 1 and G n ,
H ( n ) = G n G n + 1 = 1 0 0 n ⋅ F n − 1 1 0 0 n + 1 ⋅ F n = 1 0 0 − n n ⋅ F n 1 0 0 n + 1 ⋅ F n sub (3) = 1 0 0 n ( n + 1 ) ( 1 0 0 − n ) = 1 0 0 n − n 2 + 9 9 n + 1 0 0 H is monotonic decreasing as ( H ′ ( n ) = − n 2 1 − 1 0 0 1 < 0 )
With H ( 1 ) = 1 0 0 1 9 8 = 1 . 9 8 and H is monotonic decreasing, we check which n will make H ( n ) < 1 ; before that G n < G n + 1
H ( n ) = 1 0 0 n − n 2 + 9 9 n + 1 0 0 < 1 ⟹ − n 2 + 9 9 n + 1 0 0 < 1 0 0 n ⟹ n 2 + n − 1 0 0 > 0 ⟹ n = 2 − 1 + 1 + 4 0 0 > 2 − 1 + 4 0 0 = 2 − 1 + 2 0 = 9 . 5 neglect the -ve
It means when n > 9 . 5 , H ( n ) = G n G n + 1 < 1 which means when n ≥ 1 0 next person will get less pie than previous person.
Therefore, H ( 9 ) = G 9 G 1 0 > 1 → G 1 0 > G 9 ∴ the 1 0 t h person will get the most pie.