ISL 2013 N5
Fix an integer . Two players, called Ana and Banana, play the following game of numbers: Initially, some integer gets written on the blackboard. Then they take moves in turn, with Ana beginning. A player making a move erases the number just written on the blackboard and replaces it by some number with that is coprime to . The first player who cannot move anymore loses. An integer is called good if Banana has a winning strategy when the initial number is , and bad otherwise. Consider two integers with the property that each prime number divides if and only if it divides . Prove that either both and 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.