2006 AIME I Problems/Problem 15: Difference between revisions

Revision as of 20:26, 4 July 2006

Problem

Given that a sequence satisfies $x_0=0$ and $|x_k|=|x_{k-1}+3|$ for all integers $k\ge 1,$ find the minimum possible value of $|x_1+x_2+\cdots+x_{2006}|.$

Page

Toolbox

Search

2006 AIME I Problems/Problem 15: Difference between revisions

Revision as of 20:26, 4 July 2006

Problem

Solution

See also

Revision as of 11:15, 30 June 2006 view source MCrawford (talk \| contribs) 1,942 edits mNo edit summary ← Older edit	Revision as of 20:26, 4 July 2006 view source Joml88 (talk \| contribs) 1,619 edits m 2006 AIME I Problem 15 moved to 2006 AIME I Problems/Problem 15 Newer edit →
(No difference)