Browse · MathNet
PrintCroatian Mathematical Olympiad
Croatia counting and probability
Problem
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 and (), the player who has the turn chooses a positive integer such that , erases the number and writes on the board. The winner is the player who writes number . 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 be the positive root of the quadratic polynomial . The first player can win if the ratio of the starting numbers is in the set Let and be positive integers such that . We claim that the player who is next on the turn when and are on the board wins if and only if or . The claim is clear for , so let us assume that . If , then the player who plays next must pass on the pair of numbers and . Hence it is enough to show that the player who plays with a pair such that can either win or pass on a pair with . The player wins if he plays with the numbers such that . Let us assume that and . If , then player may pass on , as well as on . He will pass on if . Otherwise, if , he will pass on , so the other player will pass on and we know that with these numbers the player on the turn wins. If , the player passes on . We claim that . Indeed, since , we have , i.e. . Hence, the first player can in each move either win or pass on a pair such that .
Final answer
Let φ = (1 + √5)/2. The first player can force a win if and only if the initial ratio lies in [0, 1/φ] ∪ {1} ∪ [φ, +∞). Equivalently, for ordered numbers with larger divided by smaller, either the ratio equals 1 or exceeds φ.
Techniques
Games / greedy algorithmsGreatest common divisors (gcd)Linear and quadratic inequalities