Difference between revisions of "2006 AIME A Problems/Problem 15"

Latest revision as of 21:36, 31 May 2009

Redirect to:

@@ Line 1: / Line 1: @@
-== Problem ==
+#REDIRECT [[2006 AIME I Problems/Problem 15]]
-Given that a sequence satisfies <math> x_0=0 </math> and <math> |x_k|=|x_{k-1}+3| </math> for all integers <math> k\ge 1, </math> find the minimum possible value of <math> |x_1+x_2+\cdots+x_{2006}|. </math>
-== Solution ==
-{{solution}}
-== See also ==
-{{AIME box|year=2006|n=II|num-b=14|after=Final Problem}}
-[[Category:Intermediate Algebra Problems]]