MathLabs

Problem 3

Suppose that s1,s2,s3,…s_1, s_2, s_3, \dots is a strictly increasing sequence of positive integers such that the subsequences ss1,ss2,ss3,…s_{s_1}, s_{s_2}, s_{s_3}, \dots and ss1+1,ss2+1,ss3+1,…s_{s_1+1}, s_{s_2+1}, s_{s_3+1}, \dots are both arithmetic progressions. Prove that the sequence s1,s2,s3,…s_1, s_2, s_3, \dots is itself an arithmetic progression.
Step 2 of 5: Bound the consecutive differences by D
ds(n)=B−A for every n;dn≤D for every nd_{s(n)}=B-A\ \text{for every } n;\qquad d_n\le D\ \text{for every } n
Detailed analysis

Let dn=s(n+1)−s(n)≥1d_n=s(n+1)-s(n)\ge1. Since s(n)s(n) and s(n)+1s(n)+1 are consecutive integers, s(s(n)+1)−s(s(n))s(s(n)+1)-s(s(n)) is exactly ds(n)d_{s(n)}; but by Step 1 this difference equals (Dn+B)−(Dn+A)=B−A(Dn+B)-(Dn+A)=B-A. So ds(n)=B−Ad_{s(n)}=B-A for every n≥1n\ge1 — a fixed constant. Separately, s(s(n+1))−s(s(n))=Ds(s(n+1))-s(s(n))=D telescopes as the sum of the dnd_n consecutive differences ds(n)+ds(n)+1+⋯+ds(n+1)−1d_{s(n)}+d_{s(n)+1}+\dots+d_{s(n+1)-1} (there are s(n+1)−s(n)=dns(n+1)-s(n)=d_n terms). Since every term is ≥1\ge1, we get D≥dnD\ge d_n for every nn. Hence dnd_n is bounded, so m:=min⁡ndnm:=\min_n d_n and M:=max⁡ndnM:=\max_n d_n both exist.