USAMO 2004 Problem 2
- Day 1
Suppose are integers whose greatest common divisor is 1. Let be a set of integers with the following properties:
(a) For , . (b) For (not necessarily distinct), . (c) For any integers , if , then .
Prove that must be equal to the set of all integers.
Dataset text AI-MO AoPS. 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.