2001 USAMO Problems/Problem 5

Revision as of 02:38, 21 December 2008 by Minsoens (talk | contribs) (New page: == Problem == Let <math>S</math> be a set of integers (not necessarily positive) such that (a) there exist <math>a,b \in S</math> with <math>\gcd(a,b) = \gcd(a - 2,b - 2) = 1</math>; (b...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

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

(a) there exist $a,b \in S$ with $\gcd(a,b) = \gcd(a - 2,b - 2) = 1$;

(b) if $x$ and $y$ are elements of $S$ (possibly equal), then $x^2 - y$ also belongs to $S$.

Prove that $S$ is the set of all integers.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

2001 USAMO (ProblemsResources)
Preceded by
Problem 4
Followed by
Problem 6
1 2 3 4 5 6
All USAMO Problems and Solutions