1988 AIME Problems/Problem 4

Revision as of 22:20, 15 February 2014 by PythagorasofSamos (talk | contribs) (Solution 2)

Problem

Suppose that $|x_i| < 1$ for $i = 1, 2, \dots, n$. Suppose further that $|x_1| + |x_2| + \dots + |x_n| = 19 + |x_1 + x_2 + \dots + x_n|.$ What is the smallest possible value of $n$?

Solution

Solution 1

Since $|x_i| < 1$ then

\[|x_1| + |x_2| + \dots + |x_n| = 19 + |x_1 + x_2 + \dots + x_n| < n\]

So $n \ge 20$. We now just need to find an example where $n = 20$: suppose $x_{2k-1} = \frac{19}{20}$ and $x_{2k} = -\frac{19}{20}$; then on the left hand side we have $\left|\frac{19}{20}\right| + \left|-\frac{19}{20}\right| + \dots + \left|-\frac{19}{20}\right| = 20\left(\frac{19}{20}\right) = 19$. On the right hand side, we have $19 + \left|\frac{19}{20} - \frac{19}{20} + \dots - \frac{19}{20}\right| = 19 + 0 = 19$, and so the equation can hold for $n = 020$.


Solution 2

Let $|x_1 + x_2 + \dots + x_n| = 0$ and $|x_1| + |x_2| + \dots + |x_n| = 19$. Then the smallest value of $n = \boxed {20}$ because $|x_i| < 1$, and therefore $n > 19$.

See also

1988 AIME (ProblemsAnswer KeyResources)
Preceded by
Problem 3
Followed by
Problem 5
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