KöMaL problem A, 2020

Number theory Difficulty 7.0 National Olympiad, round 2 Find the answer Hungary

Find all triples $(a,b,c)$ of distinct positive integers so that there exists a subset $S$ of the positive integers for which for all positive integers $n$ exactly one element of the triple $(an,bn,cn)$ is in $S$ .

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.