Maths Olympiad Prep

Library / IMO Shortlist /330 of 365

IMO Shortlist

Algebra Difficulty 9.0 IMO level Prove it IMO

Let rr be a positive integer, and let a0,a1,…a_{0}, a_{1}, \ldots be an infinite sequence of real numbers. Assume that for all nonnegative integers mm and ss there exists a positive integer n∈[m+1,m+r]n \in [m+1, m+r] such that
am+am+1+⋯+am+s=an+an+1+⋯+an+s a_{m}+a_{m+1}+\cdots+a_{m+s}=a_{n}+a_{n+1}+\cdots+a_{n+s}
Prove that the sequence is periodic, i.e. there exists some p⩾1p \geqslant 1 such that an+p=ana_{n+p}=a_{n} for all n⩾0n \geqslant 0.

Solution

For every indices m⩽nm \leqslant n we will denote S(m,n)=am+am+1+⋯+an−1S(m, n)=a_{m}+a_{m+1}+\cdots+a_{n-1}; thus S(n,n)=0S(n, n)=0. Let us start with the following lemma.

Lemma. Let b0,b1,…b_{0}, b_{1}, \ldots be an infinite sequence. Assume that for every nonnegative integer mm there exists a nonnegative integer n∈[m+1,m+r]n \in [m+1, m+r] such that bm=bnb_{m}=b_{n}. Then for every indices k⩽ℓk \leqslant \ell there exists an index t∈[ℓ,ℓ+r−1]t \in [\ell, \ell+r-1] such that bt=bkb_{t}=b_{k}. Moreover, there are at most rr distinct numbers among the terms of (bi)(b_{i}).

Proof. To prove the first claim, let us notice that there exists an infinite sequence of indices k1=k,k2,k3,…k_{1}=k, k_{2}, k_{3}, \ldots such that bk1=bk2=⋯=bkb_{k_{1}}=b_{k_{2}}=\cdots=b_{k} and ki<ki+1⩽ki+rk_{i}<k_{i+1} \leqslant k_{i}+r for all i⩾1i \geqslant 1. This sequence is unbounded from above, thus it hits each segment of the form [ℓ,ℓ+r−1][\ell, \ell+r-1] with ℓ⩾k\ell \geqslant k, as required.

To prove the second claim, assume, to the contrary, that there exist r+1r+1 distinct numbers bi1,…,bir+1b_{i_{1}}, \ldots, b_{i_{r+1}}. Let us apply the first claim to k=i1,…,ir+1k=i_{1}, \ldots, i_{r+1} and ℓ=max⁡{i1,…,ir+1}\ell=\max \{i_{1}, \ldots, i_{r+1}\}; we obtain that for every j∈{1,…,r+1}j \in \{1, \ldots, r+1\} there exists tj∈[s,s+r−1]t_{j} \in [s, s+r-1] such that btj=bijb_{t_{j}}=b_{i_{j}}. Thus the segment [s,s+r−1][s, s+r-1] should contain r+1r+1 distinct integers, which is absurd.

Setting s=0s=0 in the problem condition, we see that the sequence (ai)(a_{i}) satisfies the condition of the lemma, thus it attains at most rr distinct values. Denote by AiA_{i} the ordered rr-tuple (ai,…,ai+r−1)(a_{i}, \ldots, a_{i+r-1}); then among AiA_{i}'s there are at most rrr^{r} distinct tuples, so for every k⩾0k \geqslant 0 two of the tuples Ak,Ak+1,…,Ak+rrA_{k}, A_{k+1}, \ldots, A_{k+r^{r}} are identical. This means that there exists a positive integer p⩽rrp \leqslant r^{r} such that the equality Ad=Ad+pA_{d}=A_{d+p} holds infinitely many times. Let DD be the set of indices dd satisfying this relation.

Now we claim that DD coincides with the set of all nonnegative integers. Since DD is unbounded, it suffices to show that d∈Dd \in D whenever d+1∈Dd+1 \in D. For that, denote bk=S(k,p+k)b_{k}=S(k, p+k). The sequence b0,b1,…b_{0}, b_{1}, \ldots satisfies the lemma conditions, so there exists an index t∈[d+1,d+r]t \in [d+1, d+r] such that S(t,t+p)=S(d,d+p)S(t, t+p)=S(d, d+p). This last relation rewrites as S(d,t)=S(d+p,t+p)S(d, t)=S(d+p, t+p). Since Ad+1=Ad+p+1A_{d+1}=A_{d+p+1}, we have S(d+1,t)=S(d+p+1,t+p)S(d+1, t)=S(d+p+1, t+p), therefore we obtain
ad=S(d,t)−S(d+1,t)=S(d+p,t+p)−S(d+p+1,t+p)=ad+p a_{d}=S(d, t)-S(d+1, t)=S(d+p, t+p)-S(d+p+1, t+p)=a_{d+p}
and thus Ad=Ad+pA_{d}=A_{d+p}, as required.

Finally, we get Ad=Ad+pA_{d}=A_{d+p} for all dd, so in particular ad=ad+pa_{d}=a_{d+p} for all dd, QED.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.