2006 AIME II Problems/Problem 11
Contents
Problem
A sequence is defined as follows and, for all positive integers Given that and find the remainder when is divided by 1000.
Solutions
Solution 1
Define the sum as . Since , the sum will be:
Thus , and are both given; the last four digits of their sum is , and half of that is . Therefore, the answer is .
Solution 3 (some guessing involved)/"Engineer's Induction"
All terms in the sequence are sums of previous terms, so the sum of all terms up to a certain point must be some linear combination of the first three terms. Also, we are given and , so we can guess that there is some way to use them in a formula. Namely, we guess that there exists some such that . From here, we list out the first few terms of the sequence and the cumulative sums, and with a little bit of substitution and algebra we see that , at least for the first few terms. From this, we have that .
Solution by zeroman; clarified by srisainandan6
See also
2006 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.