Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2006 AIME I Problems/Problem 15"
 
(23 intermediate revisions by 9 users not shown)
Line 3: Line 3:
  
 
__TOC__
 
__TOC__
−
== Solution ==
+
== Solutions ==
 
=== Solution 1 ===
 
=== Solution 1 ===
 
Suppose <math>b_{i} = \frac {x_{i}}3</math>.
 
Suppose <math>b_{i} = \frac {x_{i}}3</math>.
Line 20: Line 20:
 
Therefore
 
Therefore
 
<cmath>
 
<cmath>
−
\left|\sum_{i = 1}^{2006}b_{i}\right| = \left|\frac {(b_{2006} + 1)^{2} - 2007}2\right|\geq \frac {2025 - 2007}{2} = 9
+
\left|\sum_{i = 1}^{2006}b_{i}\right| = \left|\frac {(b_{2006} + 1)^{2} - 2007}2\right|\geq \left|\frac{2025 - 2007}{2}\right| = 9
 
</cmath>
 
</cmath>
−
So
+
This lower bound can be achieved if we use <math>b_1 = -1</math>, <math>b_2 = 0</math>, <math>b_3 = -1</math>, <math>b_4 = 0</math>, and so on until <math>b_{1962} = 0</math>, after which we let <math>b_k = b_{k - 1} + 1</math> so that <math>b_{2006} = 44</math>. So
 
<cmath>
 
<cmath>
−
\left|\sum_{i = 1}^{2006}x_{i}\right|\geq 27
+
\left|\sum_{i = 1}^{2006}x_{i}\right|\geq \boxed{027}
 
</cmath>
 
</cmath>
  
 
=== Solution 2 ===
 
=== Solution 2 ===
−
First, we state that iff <math>x_{i - 1}\ge0</math>, <math>|x_i| = |x_{i - 1}| + 3</math> and iff <math>x_{i - 1} < 0</math>, <math>|x_i| = |x_{i - 1}| - 3</math>. Now suppose <math>x_i = x_j</math> for some <math>0\le i < j\le2006</math>. Now, this means that <math>|x_i| = |x_j|</math>, and so the number of positive numbers in the set <math>\{x_i,x_{i + 1},\ldots,x_{j - 1}\}</math> equals the number of negative numbers. Now pair the numbers in this list up in the following way: Whenever a positive and a negative number are adjacent in this progression, pair them up and remove them from this list. We claim that every pair will sum to -3.
+
First, we state that [[iff]] <math>x_{i - 1}\ge0</math>, <math>|x_i| = |x_{i - 1}| + 3</math> and iff <math>x_{i - 1} < 0</math>, <math>|x_i| = |x_{i - 1}| - 3</math>. Now suppose <math>x_i = x_j</math> for some <math>0\le i < j\le2006</math>. Now, this means that <math>|x_i| = |x_j|</math>, and so the number of positive numbers in the set <math>\{x_i,x_{i + 1},\ldots,x_{j - 1}\}</math> equals the number of negative numbers. Now pair the numbers in this list up in the following way: Whenever a positive and a negative number are adjacent in this progression, pair them up and remove them from this list. We claim that every pair will sum to -3.
  
 
If the positive number comes first, then the negative number will have a magnitude three greater, so this is true. If the negative number comes first, then the positive number will have magnitude three smaller, and this will also be true. Now let us examine what happens when we remove those two from the sequence. WLOG, let the numbers be <math>x_k</math> and <math>x_{k + 1}</math>. Since one is positive and the other is negative, <math>|x_{k + 2}| = |x_{k + 1}|\pm3 = |x_k|\pm3\mp3 = |x_k| = |x_{k - 1} + 3|</math>. So the new sequence works under the same criteria as the old one. In this way, we can pair all of the numbers up in this subsequence so the sums of the pairs are -3. Thus, the average of these numbers will be -3/2 for all subsequences that start and end with the same number (not including one of those).
 
If the positive number comes first, then the negative number will have a magnitude three greater, so this is true. If the negative number comes first, then the positive number will have magnitude three smaller, and this will also be true. Now let us examine what happens when we remove those two from the sequence. WLOG, let the numbers be <math>x_k</math> and <math>x_{k + 1}</math>. Since one is positive and the other is negative, <math>|x_{k + 2}| = |x_{k + 1}|\pm3 = |x_k|\pm3\mp3 = |x_k| = |x_{k - 1} + 3|</math>. So the new sequence works under the same criteria as the old one. In this way, we can pair all of the numbers up in this subsequence so the sums of the pairs are -3. Thus, the average of these numbers will be -3/2 for all subsequences that start and end with the same number (not including one of those).
Line 47: Line 47:
 
<math>{x_{2007}}^2 = 6\left(x_1 + x_2 + \cdots + x_{2006}\right) + 9\cdot{2007}</math>
 
<math>{x_{2007}}^2 = 6\left(x_1 + x_2 + \cdots + x_{2006}\right) + 9\cdot{2007}</math>
  
−
So <math>|x_1 + x_2 + \cdots + x_{2006}| = \frac {\left|{x_{2007}}^2 - 9\cdot{2007}\right|}{6}</math>
+
So <math>|x_1 + x_2 + \cdots + x_{2006}| = \tfrac 16 \left|{x_{2007}}^2 - 9\cdot{2007}\right|</math>
 +
 
 +
We know <math>3\ |\ x_{2007}</math> and we want to minimize <math>\left|{x_{2007}}^2 - 9\cdot{2007}\right|</math>, so <math>x_{2007}</math> must be <math>3\cdot{45}</math> for it to be minimal (<math>45^2 = 2025</math> which is closest to <math>2007</math>). We can achieve this with <math>x_k=3k</math> till <math>x_{45}=135</math> and then alternating <math>x_{46}=132</math>, <math>x_{47}=135</math> and so on ... Then <math>x_{2k}=132</math> and <math>x_{2k+1}=135</math> for all <math>k>22</math>. Since <math>2007</math> is odd, we have <math>x_{2007}=135</math>.
 +
 
 +
This means that <math>|x_1 + x_2 + \cdots + x_{2006}| = \tfrac 16 \left|9(2025 - 2007)\right| = \boxed{027}</math>
 +
 
 +
=== Solution 4 ===
 +
 
 +
Playing around with a couple numbers, we see that we can generate the sequence <math>0, 3, -6, 3, -6, \cdots</math>, and we can also generate the sequence <math>3, 6, 9, 12, \cdots</math> after each <math>-6</math> value. Thus, we will apply this to try and find some bounds. We can test if the first <math>1000</math> pairs of numbers each sum up to <math>-3</math>, and the rest form an arithmetic sequence, if the first <math>990</math> pairs sum up to <math>-3</math>, and so on. When we get to <math>980</math>, we find that <math>980(-3) + 3 + 6 + \cdots + 3\cdot 46 = 303</math>. If we shift the number of pairs up by <math>1</math>, we get <math>981(-3) + 3 + 6 + \cdots + 3\cdot 44 = \boxed{027}</math>.
 +
 
 +
~ Spacesam
 +
 
 +
== Solution 5 ==
 +
 
 +
We will work our way from <math>|x_0|</math> to <math>|x_0+x_1|</math> to <math>|x_0+x_1+x_2+\dots+x_{2006}|</math>. Let the sum <math>|x_0+x_1+x_2+\dots+x_i|=S_i</math>.
 +
 
 +
Seeing as the value for the sum we want is always nonnegative, the best pseudo-strategy would be to stay as close to <math>0</math> as possible as we increase <math>i</math> to eventually get to <math>i=2006</math>. It turns out that a greedy algorithm works here. Let us start with some smaller values of <math>i</math>.
 +
 
 +
Note that we can describe <math>x_{k+1}</math> in terms of <math>x_k</math> in the following way: take <math>x_k</math>, add <math>3</math>, and either multiply by <math>-1</math> or not.
 +
 
 +
We know that <math>S_0=0</math>. When we get to <math>S_1</math>, we add in <math>x_1</math>, which is either <math>3</math> or <math>-3</math>. It does not make a difference which one we choose, so we can choose <math>3</math> for convenience. Now, <math>S_1=3</math>. <math>x_2</math> is either <math>\pm6</math>; adding <math>6</math> would take us farther away from <math>0</math>, but adding <math>-6</math> is an okay move. Thus, let <math>x_2=-6</math>, so <math>S_2=-3</math>.
 +
 
 +
<math>x_3</math> is <math>\pm3</math>. Adding <math>3</math> is clearly the right choice here, which takes us to <math>0</math>. Thus, <math>x_3=3</math> and <math>S_3=0</math>.
 +
 
 +
Let us look at how this greedy algorithm performs in general.
 +
 
 +
<math>\begin{tabular}[t]{c|ccccccc}
 +
S_i&3a&-3&3a-3&-6&3a-6&-9&\cdots\\
 +
x_i&3a&-3a-3&3a&-3a-3&3a&-3a-3&\cdots\\
 +
\end{tabular}</math>
  
−
We know <math>3\ |\ x_{2007}</math> and we want to minimize <math>\left|{x_{2007}}^2 - 9\cdot{2007}\right|</math>, so <math>x_{2007}</math> must be <math>3\cdot{45}</math> for it to be minimal (<math>45^2 = 2025</math> which is closest to <math>2007</math>).
+
(the table doesn't work; if you desire, please to go [https://artofproblemsolving.com/texer/zzyacvnp https://artofproblemsolving.com/texer/zzyacvnp] to view)
  
−
This means that <math>|x_1 + x_2 + \cdots + x_{2006}| = \left|\frac {9(2025 - 2007)}{6}\right| = \boxed{27}</math>
+
The sums alternate between separate arithmetic sequences. One of them is of particular interest to us: specifically, the one that goes <math>3a,3a-3,3a-6,\cdots</math>, because it will eventually become <math>0</math>. One can then derive using simple algebra how long it will take to reach zero, depending on <math>a</math>; it turns out that it takes <math>2a+1</math> for each cycle to complete. We can then see that <math>S_{k^2-1}=0</math> for positive integers <math>k</math>; thus, <math>S_{1935}=0</math>. We can then go through our algorithm, and it turns out that <math>S_{2006}=\boxed{027}</math>.
  
−
== Solution 4 ==
+
~Technodoggo (sorry for the rushed solution!)
−
Playing around with a couple numbers, we see that we can generate the sequence <math>0, 3, -6, 3, -6, \cdots</math>, and we can also generate the sequence <math>3, 6, 9, 12, \cdots</math> after each <math>-6</math> value. Thus, we will apply this to try and find some bounds. We can test if the first <math>1000</math> pairs of numbers each sum up to <math>-3</math>, and the rest form an arithmetic sequence, if the first <math>990</math> pairs sum up to <math>-3</math>, and so on. When we get to <math>980</math>, we find that <math>980(-3) + 3 + 6 + \cdots + 3\cdot 46 = 303</math>. If we shift the number of pairs up by <math>1</math>, we get <math>981(-3) + 3 + 6 + \cdots + 3\cdot 44 = \boxed{27}</math>. - Spacesam
 
  
 
== See also ==
 
== See also ==
 
{{AIME box|year=2006|n=I|num-b=14|after=Last Question}}
 
{{AIME box|year=2006|n=I|num-b=14|after=Last Question}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Latest revision as of 17:02, 20 September 2024

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}|.$

Solutions

Solution 1

Suppose $b_{i} = \frac {x_{i}}3$. We have \[\sum_{i = 1}^{2006}b_{i}^{2} = \sum_{i = 0}^{2005}(b_{i} + 1)^{2} = \sum_{i = 0}^{2005}(b_{i}^{2} + 2b_{i} + 1)\] So \[\sum_{i = 0}^{2005}b_{i} = \frac {b_{2006}^{2} - 2006}2\] Now \[\sum_{i = 1}^{2006}b_{i} = \frac {b_{2006}^{2} + 2b_{2006} - 2006}2\] Therefore \[\left|\sum_{i = 1}^{2006}b_{i}\right| = \left|\frac {(b_{2006} + 1)^{2} - 2007}2\right|\geq \left|\frac{2025 - 2007}{2}\right| = 9\] This lower bound can be achieved if we use $b_1 = -1$, $b_2 = 0$, $b_3 = -1$, $b_4 = 0$, and so on until $b_{1962} = 0$, after which we let $b_k = b_{k - 1} + 1$ so that $b_{2006} = 44$. So \[\left|\sum_{i = 1}^{2006}x_{i}\right|\geq \boxed{027}\]

Solution 2

First, we state that iff $x_{i - 1}\ge0$, $|x_i| = |x_{i - 1}| + 3$ and iff $x_{i - 1} < 0$, $|x_i| = |x_{i - 1}| - 3$. Now suppose $x_i = x_j$ for some $0\le i < j\le2006$. Now, this means that $|x_i| = |x_j|$, and so the number of positive numbers in the set $\{x_i,x_{i + 1},\ldots,x_{j - 1}\}$ equals the number of negative numbers. Now pair the numbers in this list up in the following way: Whenever a positive and a negative number are adjacent in this progression, pair them up and remove them from this list. We claim that every pair will sum to -3.

If the positive number comes first, then the negative number will have a magnitude three greater, so this is true. If the negative number comes first, then the positive number will have magnitude three smaller, and this will also be true. Now let us examine what happens when we remove those two from the sequence. WLOG, let the numbers be $x_k$ and $x_{k + 1}$. Since one is positive and the other is negative, $|x_{k + 2}| = |x_{k + 1}|\pm3 = |x_k|\pm3\mp3 = |x_k| = |x_{k - 1} + 3|$. So the new sequence works under the same criteria as the old one. In this way, we can pair all of the numbers up in this subsequence so the sums of the pairs are -3. Thus, the average of these numbers will be -3/2 for all subsequences that start and end with the same number (not including one of those).

Now, take all of the repeating subsequences out of the original sequence. The only thing that will be left will be a sequence $\{0,3,6,9,\cdots,3k\}$ for some even $k$. Since we started with 2006 terms, we removed $2006 - k$ (an even number) with an average of -3/2. Thus, the sum of both this remaining sequence and the removed stuff is $(2006 - k)( - 3/2) + \sum_{i = 1}^k3k = (3/2)(k - 2006 + k(k + 1)) = 3/2(k^2 + 2k - 2006)$. This must be minimized, so we find the roots: $k^2 + 2k = 2006\implies (k + 1)^2 = 2007$ and $44^2 = 1936 < 2007 < 2025 = 45^2$. Plugging in $k = 44$ yields $(3/2)(2025 - 2007) = 27$ (and $k = 42$ yields $- 237$, a worse result). Thus, $\fbox{027}$ is the closest to zero this sum can get.

Solution 3

We know $|x_k| = |x_{k - 1} + 3|$. We get rid of the absolute value by squaring both sides: ${x_k}^2 = {x_{k - 1}}^2 + 6{x_{k - 1}} + 9\Rightarrow {x_k}^2 - {x_{k - 1}}^2 = 6{x_{k - 1}} + 9$. So we set this up:

\begin{align*} {x_1}^2 - {x_0}^2 & = 6{x_0} + 9 \\ {x_2}^2 - {x_1}^2 & = 6{x_1} + 9 \\ & \vdots \\ {x_{2007}}^2 - {x_{2006}}^2 & = 6{x_{2006}} + 9 \end{align*} There are $2007$ equations. Sum them. We get: ${x_{2007}}^2 = 6\left(x_1 + x_2 + \cdots + x_{2006}\right) + 9\cdot{2007}$

So $|x_1 + x_2 + \cdots + x_{2006}| = \tfrac 16 \left|{x_{2007}}^2 - 9\cdot{2007}\right|$

We know $3\ |\ x_{2007}$ and we want to minimize $\left|{x_{2007}}^2 - 9\cdot{2007}\right|$, so $x_{2007}$ must be $3\cdot{45}$ for it to be minimal ($45^2 = 2025$ which is closest to $2007$). We can achieve this with $x_k=3k$ till $x_{45}=135$ and then alternating $x_{46}=132$, $x_{47}=135$ and so on ... Then $x_{2k}=132$ and $x_{2k+1}=135$ for all $k>22$. Since $2007$ is odd, we have $x_{2007}=135$.

This means that $|x_1 + x_2 + \cdots + x_{2006}| = \tfrac 16 \left|9(2025 - 2007)\right| = \boxed{027}$

Solution 4

Playing around with a couple numbers, we see that we can generate the sequence $0, 3, -6, 3, -6, \cdots$, and we can also generate the sequence $3, 6, 9, 12, \cdots$ after each $-6$ value. Thus, we will apply this to try and find some bounds. We can test if the first $1000$ pairs of numbers each sum up to $-3$, and the rest form an arithmetic sequence, if the first $990$ pairs sum up to $-3$, and so on. When we get to $980$, we find that $980(-3) + 3 + 6 + \cdots + 3\cdot 46 = 303$. If we shift the number of pairs up by $1$, we get $981(-3) + 3 + 6 + \cdots + 3\cdot 44 = \boxed{027}$.

~ Spacesam

Solution 5

We will work our way from $|x_0|$ to $|x_0+x_1|$ to $|x_0+x_1+x_2+\dots+x_{2006}|$. Let the sum $|x_0+x_1+x_2+\dots+x_i|=S_i$.

Seeing as the value for the sum we want is always nonnegative, the best pseudo-strategy would be to stay as close to $0$ as possible as we increase $i$ to eventually get to $i=2006$. It turns out that a greedy algorithm works here. Let us start with some smaller values of $i$.

Note that we can describe $x_{k+1}$ in terms of $x_k$ in the following way: take $x_k$, add $3$, and either multiply by $-1$ or not.

We know that $S_0=0$. When we get to $S_1$, we add in $x_1$, which is either $3$ or $-3$. It does not make a difference which one we choose, so we can choose $3$ for convenience. Now, $S_1=3$. $x_2$ is either $\pm6$; adding $6$ would take us farther away from $0$, but adding $-6$ is an okay move. Thus, let $x_2=-6$, so $S_2=-3$.

$x_3$ is $\pm3$. Adding $3$ is clearly the right choice here, which takes us to $0$. Thus, $x_3=3$ and $S_3=0$.

Let us look at how this greedy algorithm performs in general.

$\begin{tabular}[t]{c|ccccccc} S_i&3a&-3&3a-3&-6&3a-6&-9&\cdots\\ x_i&3a&-3a-3&3a&-3a-3&3a&-3a-3&\cdots\\ \end{tabular}$ (Error compiling LaTeX. Unknown error_msg)

(the table doesn't work; if you desire, please to go https://artofproblemsolving.com/texer/zzyacvnp to view)

The sums alternate between separate arithmetic sequences. One of them is of particular interest to us: specifically, the one that goes $3a,3a-3,3a-6,\cdots$, because it will eventually become $0$. One can then derive using simple algebra how long it will take to reach zero, depending on $a$; it turns out that it takes $2a+1$ for each cycle to complete. We can then see that $S_{k^2-1}=0$ for positive integers $k$; thus, $S_{1935}=0$. We can then go through our algorithm, and it turns out that $S_{2006}=\boxed{027}$.

~Technodoggo (sorry for the rushed solution!)

See also

2006 AIME I (Problems • Answer Key • Resources)
Preceded by
Problem 14 		Followed by
Last Question
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2006_AIME_I_Problems/Problem_15&oldid=227620"