Maths Olympiad Prep

Library / /525 of 1394

, 2016

Algebra Difficulty 5.2 AIME, harder Prove it United States

Problem:

An infinite sequence of real numbers a1,a2,a_{1}, a_{2}, \ldots satisfies the recurrence
an+3=an+22an+1+an a_{n+3}=a_{n+2}-2 a_{n+1}+a_{n}
for every positive integer nn. Given that a1=a3=1a_{1}=a_{3}=1 and a98=a99a_{98}=a_{99}, compute a1+a2++a100a_{1}+a_{2}+\cdots+a_{100}.

Proposed by: Evan Chen

Solution

Solution:

k=1nak=a1+a2+a3+k=1n3(ak2ak+1+ak+2)=a1+a2+a3+k=1n3ak2k=2n2ak+k=3n1ak=2a1+a3an2+an1 \begin{aligned} \sum_{k=1}^{n} a_{k} & =a_{1}+a_{2}+a_{3}+\sum_{k=1}^{n-3}\left(a_{k}-2 a_{k+1}+a_{k+2}\right) \\ & =a_{1}+a_{2}+a_{3}+\sum_{k=1}^{n-3} a_{k}-2 \sum_{k=2}^{n-2} a_{k}+\sum_{k=3}^{n-1} a_{k} \\ & =2 a_{1}+a_{3}-a_{n-2}+a_{n-1} \end{aligned}

Putting n=100n=100 gives the answer.

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.