Difference between revisions of "2004 AIME I Problems/Problem 15"
I_like_pie (talk | contribs) |
|||
| Line 8: | Line 8: | ||
== Solution == | == Solution == | ||
| + | {{solution}} | ||
== See also == | == See also == | ||
| + | * [[2004 AIME I Problems/Problem 14| Previous problem]] | ||
| + | |||
* [[2004 AIME I Problems]] | * [[2004 AIME I Problems]] | ||
Revision as of 01:46, 6 November 2006
Problem
For all positive integers 
let
and define a sequence as follows: 
and 
for all positive integers 
Let 
be the smallest 
such that 
(For example, 
and 
) Let 
be the number of positive integers 
such that 
Find the sum of the distinct prime factors of 
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
