Difference between revisions of "2006 AIME II Problems/Problem 11"
(→Solution) |
(→Solution) |
||
| Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
| + | ==Solution 1 | ||
Define the sum as <math>s</math>. Since <math>a_n\ = a_{n + 3} - a_{n + 2} - a_{n + 1} </math>, the sum will be: | Define the sum as <math>s</math>. Since <math>a_n\ = a_{n + 3} - a_{n + 2} - a_{n + 1} </math>, the sum will be: | ||
<center><math>s = a_{28} + \sum^{27}_{k=1} (a_{k+3}-a_{k+2}-a_{k+1}) \\ | <center><math>s = a_{28} + \sum^{27}_{k=1} (a_{k+3}-a_{k+2}-a_{k+1}) \\ | ||
Revision as of 22:54, 16 January 2017
Contents
Problem
A sequence is defined as follows 
and, for all positive integers 
Given that 
and 
find the remainder when 
is divided by 1000.
Solution
==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 2
Brute Force. Since the problem asks for the answer of the end value when divided by 1000, it wouldn't be that difficult because you only need to keep track of the last 3 digits.
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. 
