Mock AIME 1 Pre 2005 Problems/Problem 11
Problem
Let denote the value of the sum Determine the remainder obtained when is divided by .
Solution
Consider the polynomial
Let with . We have
where the last step follows because is 0 when is not divisible by 3, and when is divisible by 3.
We now compute . WLOG, let . Then , and . These numbers are both of the form , where is a 12th root of unity, so both of these, when raised to the 2004-th power, become . Thus, our desired sum becomes .
To find , we notice that so that . Then . Thus, our answer is .
See also
Mock AIME 1 Pre 2005 (Problems, Source) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |