Join the USAMO Guide Discord Server. Regular updates are posted there!

Let me Join!
Dismiss

USAMO 2010 #0j24

USAMO 2010Hard

From module Telescoping Sums and Products

Community difficultyNo ratings yetBe the first to rate this problem.
Understand the scale
Scale 0.5: Easiest math competition problems, often solvable even for early middle school students without experience. 1: Problems strictly for beginners, often at a moderate middle school level. 1.5: Problems for stronger beginner students, on the level of the middling problems in most middle school contests. 2: For motivated beginners, harder questions from the previous categories. 2.5: More advanced beginner problems, hardest questions from previous categories. 3: Early intermediate problems that require more creative thinking. 3.5: Tougher early intermediate problems that consistently stretch into higher-level creative thinking or conceptual knowledge. 4: Intermediate-level problems. 4.5: Upper intermediate problems approaching the upper bound for non-invitational sprint math competitions. 5: More difficult AIME problems or simple proof-based Olympiad-style problems. 6: High-level AIME-styled questions or introductory Olympiad-level questions. 7: Tougher Olympiad-level questions, may require more technical knowledge. 8: High-level Olympiad-level questions. 9: Expert Olympiad-level questions. 9.5: The hardest problems appearing on Olympiads which the strongest students could reasonably solve. 10: Historically notorious problems, generally unsuitable for even very hard competitions because they are exceedingly tedious, long, and difficult.
Telescoping seriesPrime numbersGreatest common divisors (gcd)

Problem

Let q=3p−52q = \frac{3p-5}{2} where pp is an odd prime, and let

Sq=12⋅3⋅4+15⋅6⋅7+⋯+1q(q+1)(q+2).S_q = \frac{1}{2 \cdot 3 \cdot 4} + \frac{1}{5 \cdot 6 \cdot 7} + \dots + \frac{1}{q(q+1)(q+2)}.

Prove that if 1p−2Sq=mn\frac{1}{p} - 2S_q = \frac{m}{n} for integers mm and nn, then m−nm-n is divisible by pp.

← Back to all problems