Difference between revisions of "Mock AIME 1 2006-2007 Problems/Problem 9"
m |
|||
| Line 1: | Line 1: | ||
| − | + | ==Problem== | |
| + | Let <math>a_{n}</math> be a geometric sequence for <math>n\in\mathbb{Z}</math> with <math>a_{0}=1024</math> and <math>a_{10}=1</math>. Let <math>S</math> denote the infinite sum: <math>a_{10}+a_{11}+a_{12}+...</math>. If the sum of all distinct values of <math>S</math> is <math>\frac{m}{n}</math> where <math>m</math> and <math>n</math> are relatively prime positive integers, then compute the sum of the positive prime factors of <math>n</math>. | ||
| + | ==Solution== | ||
| + | {{solution}} | ||
| − | [[Mock AIME 1 2006-2007]] | + | ---- |
| + | |||
| + | *[[Mock AIME 1 2006-2007/Problem 8 | Previous Problem]] | ||
| + | |||
| + | *[[Mock AIME 1 2006-2007/Problem 10 | Next Problem]] | ||
| + | |||
| + | *[[Mock AIME 1 2006-2007]] | ||
Revision as of 18:40, 22 August 2006
Problem
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 .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
