USAMO 2004 Problem 2
- Day 1
- Difficulty band 7
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
Human solution Solution 1 by Calvin Lin
Let and . WTS .
Consider :
- by (ii),
- by (ii),
- so by (iii), .
- , so by (iii), .
Mathematics Stack Exchange. Open licence.
Similar problems
These problems have the most words in common with this statement.