AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.

Revision history of "2001 USAMO Problems/Problem 5"

From AoPSWiki

(Latest | Earliest) View (newer 50) (older 50) (20 | 50 | 100 | 250 | 500)

Diff selection: mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with current revision, (prev) = difference with preceding revision, m = minor edit.

  • (cur) (prev) 06:38, 21 December 2008 Minsoens (Talk | contribs) (523 bytes) (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...)
(Latest | Earliest) View (newer 50) (older 50) (20 | 50 | 100 | 250 | 500)
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.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us