Difference between revisions of "2022 AIME II Problems/Problem 6"
Isabelchen (talk | contribs) m (→Solution 1) |
|||
Line 13: | Line 13: | ||
~[https://artofproblemsolving.com/wiki/index.php/User:Isabelchen isabelchen] | ~[https://artofproblemsolving.com/wiki/index.php/User:Isabelchen isabelchen] | ||
+ | |||
+ | ==Solution 2== | ||
+ | Define <math>s_N</math> to be the sum of all the negatives, and <math>s_P</math> to be the sum of all the positives. | ||
+ | |||
+ | Since the sum of the absolute values of all the numbers is <math>1</math>, <math>|s_N|+|s_P|=1</math>. | ||
+ | |||
+ | Since the sum of all the numbers is <math>0</math>, <math>s_N=-s_P\implies |s_N|=|s_P|</math>. | ||
+ | |||
+ | Therefore, <math>|s_N|=|s_P|=\frac 12</math>, so <math>s_N=-\frac 12</math> and <math>s_P=\frac 12</math> since <math>s_N</math> is negative and <math>s_P</math> is positive. | ||
+ | |||
+ | To maximize <math>x_{76}-x_{16}</math>, we need to make <math>x_{16}</math> as small of a negative as possible, and <math>x_{76}</math> as large of a positive as possible. | ||
+ | |||
+ | Note that <math>x_{76}+x_{77}+\cdots+x_{100}=\frac 12</math> is greater than or equal to <math>25x_{76}</math> because the numbers are in increasing order. | ||
+ | |||
+ | Similarly, <math>x_{1}+x_{2}+\cdots+x_{16}=-\frac 12</math> is less than or equal to <math>16x_{16}</math>. | ||
+ | |||
+ | So we now know that <math>\frac 1{50}</math> is the best we can do for <math>x_{76}</math>, and <math>-\frac 1{32}</math> is the least we can do for <math>x_{16}</math>. | ||
+ | |||
+ | Finally, the maximum value of <math>x_{76}-x_{16}=\frac 1{50}+\frac 1{32}=\frac{41}{800}</math>, so the answer is <math>\boxed{841}</math>. | ||
+ | |||
+ | (Indeed, we can easily show that <math>x_1=x_2=\cdots=x_{16}=-\frac 1{32}</math>, <math>x_{17}=x_{18}=\cdots=x_{75}=0</math>, and <math>x_{76}=x_{77}=\cdots=x_{100}=\frac 1{50}</math> works.) | ||
+ | |||
+ | ~inventivedant | ||
==See Also== | ==See Also== | ||
{{AIME box|year=2022|n=II|num-b=5|num-a=7}} | {{AIME box|year=2022|n=II|num-b=5|num-a=7}} | ||
+ | |||
+ | [[Category:Intermediate Algebra Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 13:45, 25 February 2022
Contents
Problem
Let be real numbers such that and . Among all such -tuples of numbers, the greatest value that can achieve is , where and are relatively prime positive integers. Find .
Solution 1
To find the greatest value of , must be as large as possible, and must be as small as possible. If is as large as possible, . If is as small as possible, . The other numbers between and equal to . Let , . Substituting and into and we get: ,
.
Solution 2
Define to be the sum of all the negatives, and to be the sum of all the positives.
Since the sum of the absolute values of all the numbers is , .
Since the sum of all the numbers is , .
Therefore, , so and since is negative and is positive.
To maximize , we need to make as small of a negative as possible, and as large of a positive as possible.
Note that is greater than or equal to because the numbers are in increasing order.
Similarly, is less than or equal to .
So we now know that is the best we can do for , and is the least we can do for .
Finally, the maximum value of , so the answer is .
(Indeed, we can easily show that , , and works.)
~inventivedant
See Also
2022 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 5 |
Followed by Problem 7 | |
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.