Difference between revisions of "2020 AMC 12A Problems/Problem 15"
MRENTHUSIASM (talk | contribs) m (→Solution 1) |
MRENTHUSIASM (talk | contribs) m (→Solution 1) |
||
(2 intermediate revisions by the same user not shown) | |||
Line 31: | Line 31: | ||
<asy> | <asy> | ||
/* Made by MRENTHUSIASM */ | /* Made by MRENTHUSIASM */ | ||
− | size( | + | size(200); |
− | |||
− | int | + | int xMin = -10; |
− | int numRays = | + | int xMax = 10; |
+ | int yMin = -10; | ||
+ | int yMax = 10; | ||
+ | int numRays = 24; | ||
//Draws a polar grid that goes out to a number of circles | //Draws a polar grid that goes out to a number of circles | ||
Line 43: | Line 45: | ||
for (int i = 1; i < big+1; ++i) | for (int i = 1; i < big+1; ++i) | ||
{ | { | ||
− | draw(Circle((0,0),i), gray+ linewidth(0.4)); | + | draw(Circle((0,0),i), gray+linewidth(0.4)); |
} | } | ||
for(int i=0;i<numRays;++i) | for(int i=0;i<numRays;++i) | ||
− | draw(rotate(i*360/numRays)*((-big,0)--(big,0)),gray+ linewidth(0.4)); | + | draw(rotate(i*360/numRays)*((-big,0)--(big,0)), gray+linewidth(0.4)); |
} | } | ||
− | polarGrid( | + | //Draws the horizontal gridlines |
− | + | void horizontalLines() | |
+ | { | ||
+ | for (int i = yMin+1; i < yMax; ++i) | ||
+ | { | ||
+ | draw((xMin,i)--(xMax,i), mediumgray+linewidth(0.4)); | ||
+ | } | ||
+ | } | ||
+ | |||
+ | //Draws the vertical gridlines | ||
+ | void verticalLines() | ||
+ | { | ||
+ | for (int i = xMin+1; i < xMax; ++i) | ||
+ | { | ||
+ | draw((i,yMin)--(i,yMax), mediumgray+linewidth(0.4)); | ||
+ | } | ||
+ | } | ||
+ | |||
+ | horizontalLines(); | ||
+ | verticalLines(); | ||
+ | polarGrid(xMax,numRays); | ||
+ | draw((xMin,0)--(xMax,0),black+linewidth(1.5),EndArrow(5)); | ||
+ | draw((0,yMin)--(0,yMax),black+linewidth(1.5),EndArrow(5)); | ||
+ | label("Re",(xMax,0),(2,0)); | ||
+ | label("Im",(0,yMax),(0,2)); | ||
//The n such that we're taking the nth roots of unity multiplied by 2. | //The n such that we're taking the nth roots of unity multiplied by 2. | ||
Line 69: | Line 94: | ||
dot((-2*sqrt(2),0),blue+linewidth(4.5)); | dot((-2*sqrt(2),0),blue+linewidth(4.5)); | ||
dot((8,0),blue+linewidth(4.5)); | dot((8,0),blue+linewidth(4.5)); | ||
− | |||
− | |||
− | |||
− | |||
− | |||
</asy> | </asy> | ||
By the Distance Formula, the answer is <cmath>\sqrt{(-1-8)^2+\left(\pm\sqrt{3}-0\right)^2}=\sqrt{84}=\boxed{\textbf{(D) } 2\sqrt{21}}.</cmath> | By the Distance Formula, the answer is <cmath>\sqrt{(-1-8)^2+\left(\pm\sqrt{3}-0\right)^2}=\sqrt{84}=\boxed{\textbf{(D) } 2\sqrt{21}}.</cmath> |
Latest revision as of 11:38, 13 September 2021
Contents
Problem
In the complex plane, let be the set of solutions to and let be the set of solutions to What is the greatest distance between a point of and a point of
Solution 1
We solve each equation separately:
- We solve by De Moivre's Theorem.
Let where is the magnitude of such that and is the argument of such that
We have from which
- so
- so or
- We solve by factoring by grouping.
We have The set of solutions to is
In the graph below, the points in set are shown in red, and the points in set are shown in blue. The greatest distance between a point of and a point of is the distance between to as shown in the dashed line segments. By the Distance Formula, the answer is ~lopkiloinm ~MRENTHUSIASM
Solution 2
Alternatively, we can solve by the difference of cubes:
- If then
- If then by either completing the square or the quadratic formula.
The set of solutions to is
Following the rest of Solution 1 gives the answer
~MRENTHUSIASM
See Also
2020 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 14 |
Followed by Problem 16 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.