olymmath

ISL 2013 N5

Fix an integer k⩾2k \geqslant 2. Two players, called Ana and Banana, play the following game of numbers: Initially, some integer n⩾kn \geqslant k gets written on the blackboard. Then they take moves in turn, with Ana beginning. A player making a move erases the number mm just written on the blackboard and replaces it by some number m′m^{\prime} with k⩽m′<mk \leqslant m^{\prime}<m that is coprime to mm. The first player who cannot move anymore loses. An integer n⩾kn \geqslant k is called good if Banana has a winning strategy when the initial number is nn, and bad otherwise. Consider two integers n,n′⩾kn, n^{\prime} \geqslant k with the property that each prime number p⩽kp \leqslant k divides nn if and only if it divides n′n^{\prime}. Prove that either both nn and n′n^{\prime} are good or both are bad. (Italy)

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2013 Shortlist booklet, page 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/2013/n5 · Tag AYDKA6ECMP · Edit this page on GitHub · Keys: j next, k previous