Difference between revisions of "Mock AIME 1 2006-2007 Problems/Problem 9"
m |
m |
||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
− | Let <math>a_{n}</math> be a geometric sequence | + | ===Revised statement=== |
+ | Let <math>a_{n}</math> be a [[geometric sequence]] of [[complex number]]s with <math>a_{0}=1024</math> and <math>a_{10}=1</math>, and let <math>S</math> denote the [[infinite]] sum <math>S = a_{10}+a_{11}+a_{12}+...</math>. If the sum of all possible [[distinct]] values of <math>S</math> is <math>\frac{m}{n}</math> where <math>m</math> and <math>n</math> are [[relatively prime]] [[positive integer]]s, compute the sum of the positive [[prime number | prime]] [[divisor | factors]] of <math>n</math>. | ||
+ | |||
+ | ===Original statement=== | ||
+ | |||
+ | |||
==Solution== | ==Solution== | ||
{{solution}} | {{solution}} | ||
Line 11: | Line 16: | ||
*[[Mock AIME 1 2006-2007]] | *[[Mock AIME 1 2006-2007]] | ||
+ | |||
+ | [[Category:Intermediate Complex Numbers Problems]] |
Revision as of 09:41, 30 September 2006
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
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.