, 2024

Combinatorics Difficulty 6.0 National Olympiad Find the answer United Kingdom

Let $m < n$ be positive integers. Start with $n$ piles, each of $m$ objects. Repeatedly carry out the following operation: choose two piles and remove $n$ objects in total from the two piles.

For which $(m, n)$ is it possible to empty all the piles?

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: UK Mathematics Trust, licensed © UK Mathematics Trust; question papers published free at bmos.ukmt.org.uk. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.