Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2022 AIME I Problems/Problem 4"
m (→‎Solution)
Line 31: Line 31:
 
   <li><math>s+3k\equiv0\pmod{3}</math></li><p>
 
   <li><math>s+3k\equiv0\pmod{3}</math></li><p>
 
There are <math>8</math> values for <math>s+3k,</math> so there are <math>8</math> values for <math>r.</math> It follows that <math>s\equiv0\pmod{3},</math> so there are <math>33</math> values for <math>s.</math> <p>
 
There are <math>8</math> values for <math>s+3k,</math> so there are <math>8</math> values for <math>r.</math> It follows that <math>s\equiv0\pmod{3},</math> so there are <math>33</math> values for <math>s.</math> <p>
−
There are <math>8\cdot33=264</math> ordered pairs in this case.
+
There are <math>8\cdot33=264</math> ordered pairs <math>(r,s)</math> in this case.
 
   <li><math>s+3k\equiv1\pmod{3}</math></li><p>
 
   <li><math>s+3k\equiv1\pmod{3}</math></li><p>
 
There are <math>9</math> values for <math>s+3k,</math> so there are <math>9</math> values for <math>r.</math> It follows that <math>s\equiv1\pmod{3},</math> so there are <math>34</math> values for <math>s.</math> <p>
 
There are <math>9</math> values for <math>s+3k,</math> so there are <math>9</math> values for <math>r.</math> It follows that <math>s\equiv1\pmod{3},</math> so there are <math>34</math> values for <math>s.</math> <p>
−
There are <math>9\cdot34=306</math> ordered pairs in this case.
+
There are <math>9\cdot34=306</math> ordered pairs <math>(r,s)</math> in this case.
 
   <li><math>s+3k\equiv2\pmod{3}</math></li><p>
 
   <li><math>s+3k\equiv2\pmod{3}</math></li><p>
 
There are <math>8</math> values for <math>s+3k,</math> so there are <math>8</math> values for <math>r.</math> It follows that <math>s\equiv2\pmod{3},</math> so there are <math>33</math> values for <math>s.</math> <p>
 
There are <math>8</math> values for <math>s+3k,</math> so there are <math>8</math> values for <math>r.</math> It follows that <math>s\equiv2\pmod{3},</math> so there are <math>33</math> values for <math>s.</math> <p>
−
There are <math>8\cdot33=264</math> ordered pairs in this case.
+
There are <math>8\cdot33=264</math> ordered pairs <math>(r,s)</math> in this case.
 
</ol>
 
</ol>
 
Together, the answer is <math>264+306+264=\boxed{834}.</math>
 
Together, the answer is <math>264+306+264=\boxed{834}.</math>

Revision as of 17:09, 17 February 2022

Problem

Let $w = \dfrac{\sqrt{3} + i}{2}$ and $z = \dfrac{-1 + i\sqrt{3}}{2},$ where $i = \sqrt{-1}.$ Find the number of ordered pairs $(r,s)$ of positive integers not exceeding $100$ that satisfy the equation $i \cdot w^r = z^s.$

Solution

We rewrite $w$ and $z$ in polar form: \begin{align*} w &= e^{i\cdot\frac{\pi}{6}}, \\ z &= e^{i\cdot\frac{2\pi}{3}}. \end{align*} The equation $i \cdot w^r = z^s$ becomes \begin{align*} e^{i\cdot\frac{\pi}{2}} \cdot \left(e^{i\cdot\frac{\pi}{6}}\right)^r &= \left(e^{i\cdot\frac{2\pi}{3}}\right)^s \\ e^{i\left(\frac{\pi}{2}+\frac{\pi}{6}r\right)} &= e^{i\left(\frac{2\pi}{3}s\right)} \\ \frac{\pi}{2}+\frac{\pi}{6}r &= \frac{2\pi}{3}s+2\pi k \\ 3+r &= 4s+12k \\ 3+r &= 4(s+3k). \end{align*} for some integer $k.$

Since $4\leq 3+r\leq 103$ and $4\mid 3+r,$ we conclude that \begin{align*} 3+r &\in \{4,8,12,\ldots,100\}, \\ s+3k &\in \{1,2,3,\ldots,25\}. \end{align*} Note that the values for $s+3k$ and the values for $r$ have one-to-one correspondence.

We apply casework to the values for $s+3k:$

  1. $s+3k\equiv0\pmod{3}$

    2. There are $8$ values for $s+3k,$ so there are $8$ values for $r.$ It follows that $s\equiv0\pmod{3},$ so there are $33$ values for $s.$

    There are $8\cdot33=264$ ordered pairs $(r,s)$ in this case.

  2. $s+3k\equiv1\pmod{3}$

    3. There are $9$ values for $s+3k,$ so there are $9$ values for $r.$ It follows that $s\equiv1\pmod{3},$ so there are $34$ values for $s.$

    There are $9\cdot34=306$ ordered pairs $(r,s)$ in this case.

  3. $s+3k\equiv2\pmod{3}$

    4. There are $8$ values for $s+3k,$ so there are $8$ values for $r.$ It follows that $s\equiv2\pmod{3},$ so there are $33$ values for $s.$

    There are $8\cdot33=264$ ordered pairs $(r,s)$ in this case.

Together, the answer is $264+306+264=\boxed{834}.$

~MRENTHUSIASM ~bluesoul

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2022_AIME_I_Problems/Problem_4&oldid=171139"