Maths Olympiad Prep

Library / /5 of 5

Combinatorics Difficulty 6.8 National olympiad Prove it Brazil

Two players play alternately. The first player is given a pair of positive integers (x1,y1)(x_1, y_1). Each player must replace the pair (xn,yn)(x_n, y_n) that he is given by a pair of non-negative integers (xn+1,yn+1)(x_{n+1}, y_{n+1}) such that xn+1=min(xn,yn)x_{n+1} = \min(x_n, y_n) and yn+1=max(xn,yn)kxn+1y_{n+1} = \max(x_n, y_n) - k \cdot x_{n+1} for some positive integer kk. The first player to pass on a pair with yn+1=0y_{n+1} = 0 wins. Find for which values of x1y1\frac{x_1}{y_1} the first player has a winning strategy.

Solution

Note first that draws are not possible so any position (x,y)(x, y) is either a win or a loss for the player receiving it. Let ϕ\phi be the positive root of t2t1=0t^2 - t - 1 = 0, so ϕ=1+52\phi = \frac{1+\sqrt{5}}{2}. Let m=min(x,y)m = \min(x, y), M=max(x,y)M = \max(x, y). We show that a player receiving (x,y)(x, y) wins if and only if m=Mm = M or M>ϕmM > \phi m.

If mMm \neq M and M<ϕmM < \phi m, then the player must pass on (m,Mm)(m,0)(m, M-m) \neq (m, 0) and m>ϕ(Mm)m > \phi(M-m). So it is sufficient to show that a player receiving a position with M>ϕmM > \phi m can either win or pass back a position with minm\min m' and maxM\max M' such that M<ϕmM' < \phi m' and MmM' \neq m'.

If M>ϕmM > \phi m, and MM is a multiple of mm, then the player can pass on (m,0)(m, 0) and win. So assume M>ϕmM > \phi m and M=qm+rM = qm + r with 0<r<m0 < r < m. If q2q \ge 2, then the player can choose whether to pass on (m,r)(m, r) or (m,m+r)(m, m+r). If (m,r)(m, r) is a losing position, then he wins by passing that. If it is a winning position, then

he passes (m,m+r)(m, m+r) to the other player. The other player is now forced to pass back (m,r)(m, r), which is a winning position. So we may assume q=1q = 1. Now the player passes (m,r)(m, r). We claim that m<ϕrm < \phi r and mrm \neq r. Certainly mrm \le r. But m+r>ϕmm+r > \phi m, so (ϕ1)m<r(\phi-1)m < r, so m<ϕrm < \phi r.

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

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.