2011 AIME II Problems/Problem 8
Contents
Problem
Let be the 12 zeroes of the polynomial
. For each
, let
be one of
or
. Then the maximum possible value of the real part of
can be written as
where
and
are positive integers. Find
.
Solution
![2011 AIME II -8.png](https://wiki-images.artofproblemsolving.com//b/b3/2011_AIME_II_-8.png)
The twelve dots above represent the roots of the equation
. If we write
, then the real part of
is
and the real part of
is
. The blue dots represent those roots
for which the real part of
is greater than the real part of
, and the red dots represent those roots
for which the real part of
is greater than the real part of
. Now, the sum of the real parts of the blue dots is easily seen to be
and the negative of the sum of the imaginary parts of the red dots is easily seen to also be
. Hence our desired sum is
, giving the answer
Solution ![$1.\overline{3}$](//latex.artofproblemsolving.com/5/1/8/518739446771732bd9801a2b72270a3fb77ae942.png)
As a small note, we could factor the equation as in which these are just the 12th roots of unity for
which might be easier to work with. Then we just add up the optimal real parts as in solution 1 and then multiply by 8 at the end.
Solution ![$1.\overline{6}$](//latex.artofproblemsolving.com/e/c/c/ecc12de12332ec7ab653010c3d34b568e32c8744.png)
Note that .
So, one can easily translate all the red dots by .
Then, it's easy to see that some of the points cancel out and you're left with times two.
Also, someone please help me with the graphs below I tried to add to this answer. I have no idea why there's an error with not being able to find some random file. It has something to do with the label function (when I remove the calls to label, it works fine). I've removed the asy and \asy tags for now.
Label f; f.p=fontsize(12); xaxis(-16,16,Ticks(f, 4.0)); yaxis(-12,12,Ticks(f, 4.0)); for (int i= -1; i<11; ++i) {
if (-1 <= i && i <= 4) { dot((8*cos(i*pi/6), 8*sin(i*pi/6)), 5+blue); label("#" + string(i), (1,1), NE); } else { dot((8*cos(i*pi/6), 8*sin(i*pi/6)), 5+red); label("#" + string(i), (1,1), SW); }
}
Label f; f.p=fontsize(12); xaxis(-16,16,Ticks(f, 4.0)); yaxis(-12,12,Ticks(f, 4.0)); void draw_point(int i, string l, pair direction) { dot((8*cos(i*pi/6), 8*sin(i*pi/6)), 5+black); label("#" + l, (8*cos(i*pi/6), 8*sin(i*pi/6)), direction); } draw_point(1, "hi", N);
Solution 2
The equation can be factored as follows:
Since this is a 12th degree equation, there are 12 roots. Also, since each term in the equation is even, the positive or negative value of each root is another root. That would mean there are 6 roots that can be multiplied by and since we have 6 factors, that’s 1 root per factor. We just need to solve for
in each factor and pick whether or not to multiply by
and
for each one depending on the one that yields the highest real value. After that process, we get
Adding the values up yields
, or
, and
.
-Solution by Someonenumber011.
Solution 3
Clearly, the roots are: .
Now, realize for ,
.
.
is true when
.
This means:
When ,
.
When ,
.
For the 12 roots of the polynomial in the original equation, .
.
So .
. This can be easily true for roots that are in the 3rd quadrant in the complex plane.
This cannot be true for roots in the 1st quadrant because that would yield a negative number bigger than a positive one.
Consider the roots in the 2nd and 4th quadrants. Calculate the roots, choose, and then add the ones up. You will get .
~hastapasta
Solution 4 (Brute Force)
Use De Moivre's Theorem to brute force all the roots out. Then choose the greater value of . After adeding everything up, you get
.
~hastapasta
See also
2011 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 7 |
Followed by Problem 9 | |
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.