Difference between revisions of "2022 AIME I Problems/Problem 4"
(→Solution 2) |
(→Solution 2) |
||
Line 56: | Line 56: | ||
<math> | <math> | ||
− | \begin{tabular}[t]{|l| | + | \begin{tabular}[t]{|l|cc|c|} |
− | \multicolumn{ | + | \multicolumn{4}{c}{Modular Table of r and s}\\\hline |
Name&\#1&\#2&\#3\\\hline | Name&\#1&\#2&\#3\\\hline | ||
John Doe&5&5&3&\\ | John Doe&5&5&3&\\ |
Revision as of 22:16, 17 February 2022
Problem
Let and where Find the number of ordered pairs of positive integers not exceeding that satisfy the equation
Solution
We rewrite and in polar form: The equation becomes for some integer
Since and we conclude that Note that the values for and the values for have one-to-one correspondence.
We apply casework to the values for
There are values for so there are values for It follows that so there are values for
There are ordered pairs in this case.
There are values for so there are values for It follows that so there are values for
There are ordered pairs in this case.
There are values for so there are values for It follows that so there are values for
There are ordered pairs in this case.
Together, the answer is
~MRENTHUSIASM
Solution 2
First we recognize that and because the cosine and sine sums of those angles give the values of and , respectively. By Demoivre's theorem, . When you multiply by , we can think of that as rotating the complex number 90 degrees counterclockwise in the complex plane. Therefore, by the equation we know that and land on the same angle.
This means that:
Which we can simplify to
.
$\begin{tabular}[t]{|l|cc|c|} \multicolumn{4}{c}{Modular Table of r and s}\\\hline Name&\#1&\#2&\#3\\\hline John Doe&5&5&3&\\ Jane Doe&5&5&5\\ Richard Feynman&5&5&5\\\hline \end{tabular}$ (Error compiling LaTeX. Unknown error_msg)
Video Solution (Mathematical Dexterity)
https://www.youtube.com/watch?v=XiEaCq5jf5s
See Also
2022 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
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.