Difference between revisions of "2021 AMC 12B Problems/Problem 20"
Jamess2022 (talk | contribs) (→Solution) |
Jamess2022 (talk | contribs) (→Solution 2 (Somewhat of a long method)) |
||
Line 30: | Line 30: | ||
Comparing the real and imaginary parts, we get: | Comparing the real and imaginary parts, we get: | ||
<cmath>A = -1, B = 0</cmath> | <cmath>A = -1, B = 0</cmath> | ||
− | The answer is <math>\boxed{\textbf{(A) }-z}</math>. | + | The answer is <math>\boxed{\textbf{(A) }-z}</math>. ~Jamess2022(burntTacos;-;) |
== Video Solution by OmegaLearn (Using Modular Arithmetic and Meta-solving) == | == Video Solution by OmegaLearn (Using Modular Arithmetic and Meta-solving) == |
Revision as of 11:35, 12 February 2021
Contents
Problem
Let and
be the unique polynomials such that
and the degree of
is less than
What is
Solution 1
Note that
so if
is the remainder when dividing by
,
Now,
So
, and
The answer is
Solution 2 (Somewhat of a long method)
One thing to note is that takes the form of
for some constants A and B.
Note that the roots of
are part of the solutions of
They can be easily solved with roots of unity:
Obviously the right two solutions are the roots of
We substitute
into the original equation, and
becomes 0. Using De Moivre's theorem, we get:
Expanding into rectangular complex number form:
Comparing the real and imaginary parts, we get:
The answer is
. ~Jamess2022(burntTacos;-;)
Video Solution by OmegaLearn (Using Modular Arithmetic and Meta-solving)
~ pi_is_3.14
See Also
2021 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 19 |
Followed by Problem 21 |
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.