Difference between revisions of "2004 AIME II Problems/Problem 9"

 
m
Line 3: Line 3:
  
 
== Solution ==
 
== Solution ==
 
+
{{solution}}
 
== See also ==
 
== See also ==
 +
* [[2004 AIME II Problems/Problem 8 | Previous problem]]
 +
* [[2004 AIME II Problems/Problem 10 | Next problem]]
 
* [[2004 AIME II Problems]]
 
* [[2004 AIME II Problems]]

Revision as of 00:56, 11 November 2006

Problem

A sequence of positive integers with $a_1=1$ and $a_9+a_{10}=646$ is formed so that the first three terms are in geometric progression, the second, third, and fourth terms are in arithmetic progression, and, in general, for all $n\ge1,$ the terms $a_{2n-1}, a_{2n}, a_{2n+1}$ are in geometric progression, and the terms $a_{2n}, a_{2n+1},$ and $a_{2n+2}$ are in arithmetic progression. Let $a_n$ be the greatest term in this sequence that is less than 1000. Find $n+a_n.$

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also