olymmath

USAMO 2001 Problem 5

  • Day 2

Let SS be a set of integers (not necessarily positive) such that

(a) there exist a,b∈Sa,b \in S with gcd⁡(a,b)=gcd⁡(a−2,b−2)=1\gcd(a,b)=\gcd(a-2,b-2)=1 ; (b) if xx and yy are elements of SS (possibly equal), then x2−yx^2-y also belongs to SS .

Prove that SS is 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.

Add a solution

Locator usamo/2001/p5 · Tag 9MS7B4GNDP · Edit this page on GitHub · Keys: j next, k previous