Oindri has\( 100\) chocolates. She finished eating all her chocolates in \(58\) days by eating at least one chocolate each day. Prove that, in some consecutive days, she eats exactly \(15\) chocolates.
(It was probably the hardest problem for the Junior level this year. Hope you guys have fun solving it.)
[SPOILER!!]
[SPOILER!!]
[SPOILER!!]
In case you did not get the statement, here's a better explanation. Define the number of chocolates she ate on the day. You have to prove that, for some and , where .
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Let f(n) be the number of chocolates eaten by the end of day n. There are only 15 possible remainders (mod15) so by the pigeonhole principle we have 2 cases: The first case is that there at least 13 sets of 4 which satisfy the following congruence: f(a)≡f(b)≡f(c)≡f(d)(mod15) where f(d)>f(c)>f(b)>f(a). Also f(d)−f(c)≡f(c)−f(b)≡f(b)−f(a)≡0(mod15). Say that there was no set of consecutive days where Oindri ate 15 chocolates. Then we know that f(d)−f(c),f(c)−f(b),f(b)−f(a)≥30. Therefore f(d)−f(a)≥90. Since she only has 100 chocolates we know in fact that f(d)−f(a)=90. But we have this fact 13 times over, ie. f(d1)−f(a1)=f(d2)−f(a2)=...=f(d13)−f(a13)=90. But all f(ak) are distinct, so f(ai)≥13 for some value of i where 1≤i≤13. But that implies that f(di)≥103 which is more than the number of chocolates, so we have a contradiction. Therefore our assumption was wrong and there must be some set of consecutive days where Oindri ate 15 chocolates. The second case is that there is one set of at least 5 terms which satisfies the following congruence f(a)≡f(b)≡f(c)≡f(d)≡f(e)(mod15) where f(e)>f(d)>f(c)>f(b)>f(a). Using just the same assumption and argument as before we realise that f(e)≥f(a)+120, but this again will be more than the number of chocolates, again meaning that our assumption was wrong and there must be some set of consecutive days where Oindri ate 15 chocolates.
Log in to reply
what is pigeonhole priniciple?
Log in to reply
It's like when you have more pigeons than holes, you need more holes.
Log in to reply
could u pls solve it more simply?
I was unable to answer this question at all :(