Difference between revisions of "Mock AIME 4 2006-2007 Problems/Problem 10"
m |
m (partial solution) |
||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
− | Compute the remainder when <center><p><math>{2007 \choose 0} + {2007 \choose 3} + \cdots + {2007 \choose 2007}</math></p></center> is divided by 1000. | + | Compute the [[remainder]] when <center><p><math>{2007 \choose 0} + {2007 \choose 3} + \cdots + {2007 \choose 2007}</math></p></center> is divided by 1000. |
==Solution== | ==Solution== | ||
+ | Let <math>\omega</math> and <math>\zeta</math> be the two [[complex]] third-roots of 1. Then let | ||
− | {{ | + | <math>S = (1 + \omega)^{2007} + (1 + \zeta)^{2007} + (1 + 1)^{2007} = \sum_{i = 0}^{2007} {2007 \choose i}(\omega^i + \zeta^i + 1)</math>. |
+ | |||
+ | Now, if <math>i</math> is a [[multiple]] of 3, <math>\omega^i + \zeta^i + 1 = 1 + 1 + 1 = 3</math>. If <math>i</math> is one more than a multiple of 3, <math>\omega^i + \zeta^i + 1 = \omega + \zeta + 1 = 0</math>. If <math>i</math> is two more than a multiple of 3, <math>\omega^i + \zeta^i + 1 = \omega^2 + \zeta^2 + 1= \zeta + \omega + 1 = 0</math>. Thus | ||
+ | |||
+ | <math>S = \sum_{i = 0}^{669} 3 {2007 \choose 3i}</math>, which is exactly three times our desired expression. | ||
+ | We also have an alternative method for calculating <math>S</math>: we know that <math>\{\omega, \zeta\} = \{-\frac{1}{2} + \frac{\sqrt 3}{2}i, -\frac{1}{2} - \frac{\sqrt 3}{2}i\}</math>, so <math>\{1 + \omega, 1 + \zeta\} = \{\frac{1}{2} + \frac{\sqrt 3}{2}i, \frac{1}{2} - \frac{\sqrt 3}{2}i\}</math>. Note that these two numbers are both cube roots of -1, so <math>S = (1 + \omega)^{2007} + (1 + \zeta)^{2007} + (1 + 1)^{2007} = (-1)^{669} + (-1)^{669} + 2^{2007} = 2^{2007} - 2</math>. | ||
+ | Thus, the problem is reduced to calculating <math>2^{2007} \pmod{1000}</math>. | ||
+ | {{solution}} | ||
---- | ---- | ||
Line 12: | Line 20: | ||
*[[Mock AIME 4 2006-2007 Problems/Problem 9| Previous Problem]] | *[[Mock AIME 4 2006-2007 Problems/Problem 9| Previous Problem]] | ||
*[[Mock AIME 4 2006-2007 Problems]] | *[[Mock AIME 4 2006-2007 Problems]] | ||
+ | * [[Binomial theorem]] | ||
+ | *[[Modular arithmetic]] |
Revision as of 15:19, 19 January 2007
Problem
Compute the remainder when
is divided by 1000.
Solution
Let and be the two complex third-roots of 1. Then let
.
Now, if is a multiple of 3, . If is one more than a multiple of 3, . If is two more than a multiple of 3, . Thus
, which is exactly three times our desired expression.
We also have an alternative method for calculating : we know that , so . Note that these two numbers are both cube roots of -1, so .
Thus, the problem is reduced to calculating .
This problem needs a solution. If you have a solution for it, please help us out by adding it.