Problem: Consider the sequence a1,a2,a3,… defined by a1=20242024 and for each positive integer n, an+1=an−2. Prove that there exists an integer k such that ak+2=ak. Here ∣x∣ denotes the absolute value of x.
Solution
Solution: As long as an⩾2 we have an+1=an−2 and so the sequence begins with an arithmetic progression with common difference d=−2. Let k be the first index such that ak<2. So ak−1⩾2. Therefore ak=ak−1−2⩾2−2=0. Thus we have 0≤ak<2. From this we can calculate ak−2<0 and so ak−2=2−ak. ⟹ak+1=(2−ak) Since ak+1=(2−ak)⩽(2−0)=2, this means that (ak+1−2) is negative and thus ak+2=ak+1−2=(2−ak+1)=(2−(2−ak))=ak. as required.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.