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

Let me Join!
Dismiss

USA IMO 2003 #0i8q

USA IMO 2003Hard

From module Sequences and Series II

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.
Invariants / monovariantsInduction / smoothingSequences and Series

Problem

Let n≠0n \neq 0. For every sequence of integers

a=a0,a1,a2,…,ana = a_0, a_1, a_2, \dots, a_n

satisfying 0≤ai≤i0 \le a_i \le i, for i=0,…,ni = 0, \dots, n, define another sequence

t(a)=t(a)0,t(a)1,t(a)2,…,t(a)nt(a) = t(a)_0, t(a)_1, t(a)_2, \dots, t(a)_n

by setting t(a)it(a)_i to be the number of terms in the sequence aa that precede the term aia_i and are different from aia_i. Show that, starting from any sequence aa as above, fewer than nn applications of the transformation tt lead to a sequence bb such that t(b)=bt(b) = b.

← Back to all problems