1985 AIME Problems/Problem 5

Revision as of 13:56, 18 November 2006 by JBL (talk | contribs)

Problem

A sequence of integers $a_1, a_2, a_3, \ldots$ is chosen so that $a_n = a_{n - 1} - a_{n - 2}$ for each $n \ge 3$. What is the sum of the first 2001 terms of this sequence if the sum of the first 1492 terms is 1985, and the sum of the first 1985 terms is 1492?

Solution

The problem gives us a sequence defined by a recursion, so let's calculate a few values to get a feel for how it acts. We aren't given initial values, so let $a_1 = a$ and $a_2 = b$. Then $a_3 = b - a$, $a_4 = (b - a) - b = -a$, $a_5 = -a - (b - a) = -b$, $a_6 = -b - (-a) = a - b$, $a_7 = (a - b) - (-b) = a$ and ...

This problem needs a solution. If you have a solution for it, please help us out by adding it.


See also