Pie Pie Pie

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?


The answer is 10.

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.

2 solutions

Pop Wong
Aug 19, 2020

Let G n G_n be the partition of pie that n t h n^{th} person get, F n F_n be the remaining Pie after n t h n^{th} person get their pie.

F n = 100 n 100 F n 1 ( 1 ) G n = n 100 F n 1 ( 2 ) F_n = \cfrac{100-n}{100} \cdot F_{n-1} \hspace{20mm} (1) \\ G_n = \cfrac{n}{100} \cdot F_{n-1} \hspace{26mm} (2) Rearrange (1),

F n 1 = 100 100 n F n ( 3 ) F_{n-1} = \cfrac{100}{100-n} \cdot F_{n} \hspace{20mm} (3)

Compare G n + 1 G_{n+1} and G n G_{n} ,

H ( n ) = G n + 1 G n = n + 1 100 F n n 100 F n 1 = n + 1 100 F n n 100 n F n sub (3) = ( n + 1 ) ( 100 n ) 100 n = n 2 + 99 n + 100 100 n H is monotonic decreasing as ( H ( n ) = 1 n 2 1 100 < 0 ) \begin{aligned} H(n) &= \cfrac{G_{n+1}}{G_n} = \cfrac{ \cfrac{n+1}{100} \cdot F_{n} } { \cfrac{n}{100} \cdot F_{n-1} } \hspace{10mm} \\ &=\cfrac{ \cfrac{n+1}{100} \cdot \cancel{F_{n}} } { \cfrac{n}{100-n} \cdot \cancel{ F_{n} } } \hspace{10mm} \text{sub (3)} \\ &=\cfrac{ (n+1)(100-n) }{ 100n } \\ &=\cfrac{ -n^2+99n+100 }{ 100n } \hspace{10mm} \text{H is monotonic decreasing as } \left( H'(n) = -\cfrac{1}{n^2} - \cfrac{1}{100} < 0 \right) \end{aligned}

With H ( 1 ) = 198 100 = 1.98 H(1) = \cfrac{198}{100} = 1.98 and H H is monotonic decreasing, we check which n n will make H ( n ) < 1 H(n) < 1 ; before that G n < G n + 1 G_{n} < G_{n+1}

H ( n ) = n 2 + 99 n + 100 100 n < 1 n 2 + 99 n + 100 < 100 n n 2 + n 100 > 0 n = 1 + 1 + 400 2 > 1 + 400 2 = 1 + 20 2 = 9.5 neglect the -ve \begin{aligned} H(n) &=\cfrac{ -n^2+99n+100 }{ 100n } < 1 \\ &\implies -n^2+99n+100 < 100n \\ &\implies n^2+n-100 > 0 \\ &\implies n = \cfrac{-1+\sqrt{1+400}}{2} > \cfrac{-1+\sqrt{400}}{2} = \cfrac{-1+ 20}{2} = 9.5 \hspace{5mm} \text{neglect the -ve } \\ \end{aligned}

It means when n > 9.5 , H ( n ) = G n + 1 G n < 1 n>9.5, H(n) = \cfrac{G_{n+1}}{G_{n}}< 1 which means when n 10 n\geq 10 next person will get less pie than previous person.

Therefore, H ( 9 ) = G 10 G 9 > 1 G 10 > G 9 H(9) = \cfrac{G_{10}}{G_{9}} > 1 \rightarrow G_{10} > G_{9} \therefore the 1 0 t h \boxed{10^{th} } person will get the most pie.

Barry Leung
Aug 14, 2020

The problem is equivalent to finding integer n n for which n ( 99 ) ( 98 ) ( 97 ) . . . ( 101 n ) 10 0 n \dfrac {n(99)(98)(97) ... (101 - n)}{100^n} is maximum.

Can anyone tell me your approach of finding n n ?

Can you please write it well to find the maximum 😂 I cant find the pattern of the fraction

Floo Flo - 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...