Difference between revisions of "2020 AMC 12A Problems/Problem 15"
MRENTHUSIASM (talk | contribs) m (→Solution 1) |
MRENTHUSIASM (talk | contribs) (Sol 1 polished! :)) |
||
Line 28: | Line 28: | ||
The set of solutions to <math>z^{3}-8z^{2}-8z+64=0</math> is <math>\boldsymbol{B=\left\{2\sqrt{2}i,-2\sqrt{2}i,8\right\}}.</math> | The set of solutions to <math>z^{3}-8z^{2}-8z+64=0</math> is <math>\boldsymbol{B=\left\{2\sqrt{2}i,-2\sqrt{2}i,8\right\}}.</math> | ||
</ol> | </ol> | ||
− | In the graph below, the greatest distance between a point of <math>A</math> and a point of <math>B</math> is the distance between <math>-1\pm\sqrt{3}i</math> to <math>8,</math> as shown in the dashed line segments. By the Distance Formula, the answer is <cmath>\sqrt{(8-(-1))^2+\left(\pm\sqrt{3}-0\right)^2}=\sqrt{84}=\boxed{\textbf{(D) } 2\sqrt{21}}.</cmath> | + | In the graph below, the points in set <math>A</math> are shown in red, and the points in set <math>B</math> are shown in blue. The greatest distance between a point of <math>A</math> and a point of <math>B</math> is the distance between <math>-1\pm\sqrt{3}i</math> to <math>8,</math> as shown in the dashed line segments. By the Distance Formula, the answer is <cmath>\sqrt{(8-(-1))^2+\left(\pm\sqrt{3}-0\right)^2}=\sqrt{84}=\boxed{\textbf{(D) } 2\sqrt{21}}.</cmath> |
− | < | + | <asy> |
+ | /* Made by MRENTHUSIASM */ | ||
+ | size(220); | ||
+ | import TrigMacros; | ||
+ | |||
+ | int big = 10; | ||
+ | int numRays = 12; | ||
+ | |||
+ | //Draws a polar grid that goes out to a number of circles | ||
+ | //equal to big, with numRays specifying the number of rays: | ||
+ | void polarGrid(int big, int numRays) | ||
+ | { | ||
+ | for (int i = 1; i < big+1; ++i) | ||
+ | { | ||
+ | draw(Circle((0,0),i), gray+ linewidth(0.4)); | ||
+ | } | ||
+ | for(int i=0;i<numRays;++i) | ||
+ | draw(rotate(i*360/numRays)*((-big,0)--(big,0)),gray+ linewidth(0.4)); | ||
+ | } | ||
+ | |||
+ | polarGrid(big, numRays); | ||
+ | rr_cartesian_axes(-big,big,-big,big,complexplane=true); | ||
+ | |||
+ | //The n such that we're taking the nth roots of unity multiplied by 2. | ||
+ | int n = 3; | ||
+ | |||
+ | pair A[]; | ||
+ | for(int i = 0; i <= n-1; i+=1) { | ||
+ | A[i] = rotate(360*i/n)*(2,0); | ||
+ | } | ||
+ | |||
+ | draw(Circle((0,0),2),red); | ||
+ | draw(A[1]--(8,0),dashed); | ||
+ | draw(A[2]--(8,0),dashed); | ||
+ | |||
+ | for(int i = 0; i< n; ++i) dot(A[i],red+linewidth(4.5)); | ||
+ | |||
+ | 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)); | ||
+ | |||
+ | add(legend(),point(E),20E,UnFill); | ||
+ | </asy> | ||
~lopkiloinm ~MRENTHUSIASM | ~lopkiloinm ~MRENTHUSIASM | ||
− | == | + | ==Solution 2== |
In the graph below, the solutions to <math>z^{3}-8=0</math> are shown in red, and the solutions to <math>z^{3}-8z^{2}-8z+64=0</math> are shown in blue. The greatest distance between one red point and one blue point is shown in a black dashed line segment. | In the graph below, the solutions to <math>z^{3}-8=0</math> are shown in red, and the solutions to <math>z^{3}-8z^{2}-8z+64=0</math> are shown in blue. The greatest distance between one red point and one blue point is shown in a black dashed line segment. | ||
Revision as of 03:49, 11 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
In the graph below, the solutions to are shown in red, and the solutions to are shown in blue. The greatest distance between one red point and one blue point is shown in a black dashed line segment.
Graph in Desmos: https://www.desmos.com/calculator/uylcxkffak
~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.