ISL 2023 C1
Let and be positive integers greater than 1 . In each unit square of an grid lies a coin with its tail-side up. A move consists of the following steps: 1. select a square in the grid; 2. flip the coins in the top-left and bottom-right unit squares; 3. flip the coin in either the top-right or bottom-left unit square. Determine all pairs for which it is possible that every coin shows head-side up after a finite number of moves. (Thailand)
Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.
Official text: IMO 2023 Shortlist booklet, page 7.
Show the answer
3 \mid m n
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.