AoPSWiki
Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.

2001 USAMO Problems/Problem 5

From AoPSWiki

Revision as of 06:38, 21 December 2008 by Minsoens (Talk | contribs)
(diff) ← Older revision | Current 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 (Problems • Resources: AoPS | ML)
Preceded by
Problem 4
1 2 3 4 5 6 Followed by
Problem 6
Want to learn how to tackle those tough AMC/AIME/Olympiad algebra problems? Check out Art of Problem Solving's Intermediate Algebra by Richard Rusczyk and Mathew Crawford. Over 1600 problems!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us