ISL 2010 C7
Let be arithmetic progressions of integers, the following conditions being satisfied: (i) each integer belongs to at least one of them; (ii) each progression contains a number which does not belong to other progressions. Denote by the least common multiple of steps of these progressions; let be its prime factorization. Prove that (Germany)
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.