Difference between revisions of "Mock AIME 1 2006-2007 Problems/Problem 9"
m |
Armalite46 (talk | contribs) (→Solutions) |
||
Line 10: | Line 10: | ||
Let the [[ratio]] of consecutive terms of the sequence be <math>r \in \mathbb{C}</math>. Then we have by the given that <math>1 = a_{10} = r^{10} a_0 = 1024r^{10}</math> so <math>r^{10} = 2^{-10}</math> and <math>r = \frac \omega 2</math>, where <math>\omega</math> can be any of the tenth [[roots of unity]]. | Let the [[ratio]] of consecutive terms of the sequence be <math>r \in \mathbb{C}</math>. Then we have by the given that <math>1 = a_{10} = r^{10} a_0 = 1024r^{10}</math> so <math>r^{10} = 2^{-10}</math> and <math>r = \frac \omega 2</math>, where <math>\omega</math> can be any of the tenth [[roots of unity]]. | ||
− | Then the sum <math>S = a_{10} + a_{11} + \ldots = 1 + r + r^2 +\ldots = \frac{1}{1-r}</math> has value <math>\frac 1{1 - \omega / 2}</math>. Different choices of <math>\omega</math> clearly lead to different values for <math>S</math>, so we don't need to worry about the distinctness condition in the problem. Then the value we want is <math>\sum_{\omega^{10} = 1} \sum_{i = 10}^\infty 1024 \left(\frac\omega2\right)^i = 1024 \sum_{i = 10}^\infty 2^{-i} \sum_{\omega^{10}=1} \omega^i</math>. Now, recall that if <math>z_1, z_2, \ldots, z_n</math> are the <math>n</math> <math>n</math>th [[root of unity | roots of unity]] then for any [[integer]] <math>m</math>, <math>z_1^m + \ldots + z_n^m</math> is 0 unless <math>n | m</math> in which case it is 1. Thus this simplifies to | + | Then the sum <math>S = a_{10} + a_{11} + \ldots = 1 + r + r^2 +\ldots = \frac{1}{1-r}</math> has value <math>\frac 1{1 - \omega / 2}</math>. Different choices of <math>\omega</math> clearly lead to different values for <math>S</math>, so we don't need to worry about the distinctness condition in the problem. Then the value we want is <math>\sum_{\omega^{10} = 1} \sum_{i = 10}^\infty 1024 \left(\frac\omega2\right)^i = 1024 \sum_{i = 10}^\infty 2^{-i} \sum_{\omega^{10}=1} \omega^i</math>. Now, recall that if <math>z_1, z_2, \ldots, z_n</math> are the <math>n</math> <math>n</math>th [[root of unity | roots of unity]] then for any [[integer]] <math>m</math>, <math>z_1^m + \ldots + z_n^m</math> is 0 unless <math>n | m</math> in which case it is 1. Thus this simplifies to |
− | |||
<math>\sum\frac1{1-z/2}</math> where <math>z^{10}=1</math>. | <math>\sum\frac1{1-z/2}</math> where <math>z^{10}=1</math>. | ||
Line 21: | Line 20: | ||
We seek <math>\sum t</math>, or the negative of the coefficient of <math>t^9</math> divided by the coefficient of <math>t^10</math>, which is <math>2^{10}\cdot10/(2^{10}-1)=2^{11}\cdot5/(2^{10}-1)</math> and <math>2^{10}-1=33*31=3*11*31</math>. | We seek <math>\sum t</math>, or the negative of the coefficient of <math>t^9</math> divided by the coefficient of <math>t^10</math>, which is <math>2^{10}\cdot10/(2^{10}-1)=2^{11}\cdot5/(2^{10}-1)</math> and <math>2^{10}-1=33*31=3*11*31</math>. | ||
− | Therefore the answer is 45. | + | Therefore the answer is <math>\box{45}</math>. |
− | |||
− | |||
==See Also== | ==See Also== |
Revision as of 14:14, 6 August 2013
Contents
Problem
Revised statement
Let be a geometric sequence of complex numbers with and , and let denote the infinite sum . If the sum of all possible distinct values of is where and are relatively prime positive integers, compute the sum of the positive prime factors of .
Original statement
Let be a geometric sequence for with and . Let denote the infinite sum: . If the sum of all distinct values of is where and are relatively prime positive integers, then compute the sum of the positive prime factors of .
Solutions
Solution 1
Let the ratio of consecutive terms of the sequence be . Then we have by the given that so and , where can be any of the tenth roots of unity.
Then the sum has value . Different choices of clearly lead to different values for , so we don't need to worry about the distinctness condition in the problem. Then the value we want is . Now, recall that if are the th roots of unity then for any integer , is 0 unless in which case it is 1. Thus this simplifies to
where .
Let ,
and
We seek , or the negative of the coefficient of divided by the coefficient of , which is and .
Therefore the answer is $\box{45}$ (Error compiling LaTeX. Unknown error_msg).