Maths Olympiad Prep

Library / Croatian Mathematical Olympiad /28 of 37

Croatian Mathematical Olympiad

Combinatorics Difficulty 6.9 National Olympiad Prove it Croatia

Two positive integers are written on the board. Two players take turns in a game changing the numbers on the board. If the numbers on the board are AA and BB (A≥BA \ge B), the player who has the turn chooses a positive integer kk such that A−kB≥0A - kB \ge 0, erases the number AA and writes A−kBA - kB on the board. The winner is the player who writes number 00.
Determine all ratios of the starting two numbers for which the first player can win independently of the choices of the second player. (Brazil 1987)

Solution

Let φ=1+52\varphi = \frac{1+\sqrt{5}}{2} be the positive root of the quadratic polynomial t2−t−1t^2 - t - 1. The first player can win if the ratio of the starting numbers is in the set
⟨0,1φ⟩∪{1}∪⟨φ,+∞⟩. \langle 0, \frac{1}{\varphi} \rangle \cup \{1\} \cup \langle \varphi, +\infty \rangle.
Let MM and mm be positive integers such that M≥mM \geq m. We claim that the player who is next on the turn when MM and mm are on the board wins if and only if m=Mm = M or M>φmM > \varphi m. The claim is clear for m=Mm = M, so let us assume that m≠Mm \neq M.
If M<φmM < \varphi m, then the player who plays next must pass on the pair of numbers (m,M−m)≠(m,0)(m, M-m) \neq (m, 0) and m>φ(M−m)m > \varphi(M-m). Hence it is enough to show that the player who plays with a pair such that M>φmM > \varphi m can either win or pass on a pair (m′,M′)(m', M') with m′<M′<φm′m' < M' < \varphi m'.
The player wins if he plays with the numbers such that m∣Mm \mid M. Let us assume that M>φmM > \varphi m and M=qm+r,0<r<mM = qm + r, 0 < r < m. If q≥2q \geq 2, then player may pass on (m,r)(m, r), as well as on (m,m+r)(m, m+r). He will pass on (m,r)(m, r) if r<m<φrr < m < \varphi r. Otherwise, if m>φrm > \varphi r, he will pass on (m,m+r)(m, m+r), so the other player will pass on (m,r)(m, r) and we know that with these numbers the player on the turn wins. If q=1q = 1, the player passes on (m,r)(m, r). We claim that r≠m<φrr \neq m < \varphi r. Indeed, since m+r>φmm + r > \varphi m, we have (φ−1)m<r(\varphi - 1)m < r, i.e. m<φrm < \varphi r.
Hence, the first player can in each move either win or pass on a pair (m′,M′)(m', M') such that m′<M′<φm′m' < M' < \varphi m'.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.