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 "1988 AIME Problems/Problem 4"

(→‎Solution 2)
(removed solution 2 because it didn't work)
Line 7: Line 7:
  
 
== Solution ==
 
== Solution ==
−
===Solution 1===
+
 
 
Since <math>|x_i| < 1</math> then
 
Since <math>|x_i| < 1</math> then
  
Line 13: Line 13:
  
 
So <math>n \ge 20</math>. We now just need to find an example where <math>n = 20</math>: suppose <math>x_{2k-1} = \frac{19}{20}</math> and <math>x_{2k} = -\frac{19}{20}</math>; then on the left hand side we have <math>\left|\frac{19}{20}\right| + \left|-\frac{19}{20}\right| + \dots + \left|-\frac{19}{20}\right| = 20\left(\frac{19}{20}\right) = 19</math>. On the right hand side, we have <math>19 + \left|\frac{19}{20} - \frac{19}{20} + \dots - \frac{19}{20}\right| = 19 + 0 = 19</math>, and so the equation can hold for <math>n = \boxed{020}</math>.
 
So <math>n \ge 20</math>. We now just need to find an example where <math>n = 20</math>: suppose <math>x_{2k-1} = \frac{19}{20}</math> and <math>x_{2k} = -\frac{19}{20}</math>; then on the left hand side we have <math>\left|\frac{19}{20}\right| + \left|-\frac{19}{20}\right| + \dots + \left|-\frac{19}{20}\right| = 20\left(\frac{19}{20}\right) = 19</math>. On the right hand side, we have <math>19 + \left|\frac{19}{20} - \frac{19}{20} + \dots - \frac{19}{20}\right| = 19 + 0 = 19</math>, and so the equation can hold for <math>n = \boxed{020}</math>.
−
 
−
===Solution 2 (???dubious)===
 
−
 
−
Let <math>|x_1 + x_2 + \dots + x_n| = 0</math> and <math>|x_1| + |x_2| + \dots + |x_n| = 19</math>. Then the smallest value of <math>n = \boxed {20}</math> because <math>|x_i| < 1</math>, and therefore <math>n > 19</math>.
 
  
 
== See also ==
 
== See also ==

Revision as of 00:23, 14 June 2014

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

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 = \boxed{020}$.

See also

1988 AIME (Problems • Answer Key • Resources)
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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1988_AIME_Problems/Problem_4&oldid=62273"