olymmath

ISL 2020 C8

Players AA and BB play a game on a blackboard that initially contains 2020 copies of the number 1. In every round, player AA erases two numbers xx and yy from the blackboard, and then player BB writes one of the numbers x+yx+y and ∣x−y∣|x-y| on the blackboard. The game terminates as soon as, at the end of some round, one of the following holds: (1) one of the numbers on the blackboard is larger than the sum of all other numbers; (2) there are only zeros on the blackboard. Player BB must then give as many cookies to player AA as there are numbers on the blackboard. Player AA wants to get as many cookies as possible, whereas player BB wants to give as few as possible. Determine the number of cookies that AA receives if both players play optimally.

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2020 Shortlist booklet, page 9.

Show the answer

7

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2020/c8 · Tag HR6NFF9B98 · Edit this page on GitHub · Keys: j next, k previous