A chess grandmaster has 11 weeks to prepare for the World Chess Championships. For training he decides to play at least one game every day. However, in order not to tire himself he decides not to play more than 12 games in any consecutive 7 day period.
Show that there exists a succession of days during while he plays exactly 22 games (No more, no less). Give proof.
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
(This solution is not fully original)Let us say that an denotes the number of games he plays in the first n days of his practice.Now let us consider the 154 numbers,a1,a2,...a76,a77,a1+22,a2+22,...a76+22,a77+22, in this set the largest number is ≤11×12+22=154,now since all the numbers ai are different as he plays at least one game a day.So we see,by PHP,that if he doesn't play 12 games in any 7 day period then two numbers would be equal,hence it would mean that,ak+22=ai hence proving that he definitely played 22 games in a consecutive day period.But,if he plays 12 games every period of 7 days,then......
Log in to reply
Can you finish your solution please.
Log in to reply
Yes,sorry about that,have been a little busy this week.I don't think i will be much active till Dec 6th(RMO).