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 "2005 AIME II Problems/Problem 9"

(→‎Solution)
Line 14: Line 14:
 
=== Solution 2 ===
 
=== Solution 2 ===
 
This problem begs us to use the familiar identity <math>e^{it} = \cos(t) + i \sin(t)</math>. Notice, <math>\sin(t) + i \cos(t) = i(\cos(t) - i \sin(t)) = i e^{-it}</math> since <math>\sin(-t) = -\sin(t)</math>. Using this, <math>(\sin(t) + i \cos(t))^n = \sin(nt) + i \cos(nt)</math> is recast as <math>(i e^{-it})^n = i e^{-itn}</math>. Hence we must have <math>i^n = i \Rightarrow i^{n-1} = 1 \Rightarrow n \equiv 1 \bmod{4}</math>. Thus since <math>1000</math> is a multiple of <math>4</math> exactly one quarter of the residues are congruent to <math>1</math> hence we have <math>\boxed{250}</math>.
 
This problem begs us to use the familiar identity <math>e^{it} = \cos(t) + i \sin(t)</math>. Notice, <math>\sin(t) + i \cos(t) = i(\cos(t) - i \sin(t)) = i e^{-it}</math> since <math>\sin(-t) = -\sin(t)</math>. Using this, <math>(\sin(t) + i \cos(t))^n = \sin(nt) + i \cos(nt)</math> is recast as <math>(i e^{-it})^n = i e^{-itn}</math>. Hence we must have <math>i^n = i \Rightarrow i^{n-1} = 1 \Rightarrow n \equiv 1 \bmod{4}</math>. Thus since <math>1000</math> is a multiple of <math>4</math> exactly one quarter of the residues are congruent to <math>1</math> hence we have <math>\boxed{250}</math>.
−
 
−
=== Solution 3 ===
 
−
 
−
De Moivre's Theorem states that <math>(\cos(t) + i \sin(t))^n = \cos(nt) + i \sin(nt).</math> However, our given expression is <math>(\sin (t) + i \cos (t))^n</math>. We use the identity <math>\sin(x) = \cos(90-x)</math> to substitute things in, getting <math>(\cos(90-t) + i \sin(90-t))^n</math>. We now use De Moivre's, getting <math>\cos(90n-nt) + i \sin(90n-nt)</math>. We want this to be equal to <math>\cos(90-nt) + i \sin(90-nt)</math>. This is only true when the two angles are the same, or when their difference is a multiple of <math>90</math>. <math>(90n - nt) - (90 - nt) = 90(n-1)</math>. <math>90(n-1)</math> is only a multiple of <math>360</math> when <math>n-1</math> is a multiple of <math>4</math>, or when <math>n \equiv 1 \bmod {4}</math>. There are therefore <math>\boxed{250}</math> possible values of <math>n</math>.
 
−
 
−
== See also ==
 
−
{{AIME box|year=2005|n=II|num-b=8|num-a=10}}
 
  
 
[[Category:Intermediate Algebra Problems]]
 
[[Category:Intermediate Algebra Problems]]
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 23:48, 10 March 2016

Problem

For how many positive integers $n$ less than or equal to $1000$ is $(\sin t + i \cos t)^n = \sin nt + i \cos nt$ true for all real $t$?

Solution

Solution 1

We know by De Moivre's Theorem that $(\cos t + i \sin t)^n = \cos nt + i \sin nt$ for all real numbers $t$ and all integers $n$. So, we'd like to somehow convert our given expression into a form from which we can apply De Moivre's Theorem.

Recall the trigonometric identities $\cos (\frac{\pi}2 - u) = \sin u$ and $\sin (\frac{\pi}2 - u) = \cos u$ hold for all real $u$. If our original equation holds for all $t$, it must certainly hold for $t = \frac{\pi}2 - u$. Thus, the question is equivalent to asking for how many positive integers $n \leq 1000$ we have that $\left(\sin\left(\frac\pi2 - u\right) + i \cos\left(\frac\pi 2 - u\right)\right)^n = \sin n \left(\frac\pi2 -u \right) + i\cos n \left(\frac\pi2 - u\right)$ holds for all real $u$.

$\left(\sin\left(\frac\pi2 - u\right) + i \cos\left(\frac\pi 2 - u\right)\right)^n = \left(\cos u + i \sin u\right)^n = \cos nu + i\sin nu$. We know that two complex numbers are equal if and only if both their real part and imaginary part are equal. Thus, we need to find all $n$ such that $\cos n u = \sin n\left(\frac\pi2 - u\right)$ and $\sin nu = \cos n\left(\frac\pi2 - u\right)$ hold for all real $u$.

$\sin x = \cos y$ if and only if either $x + y = \frac \pi 2 + 2\pi \cdot k$ or $x - y = \frac\pi2 + 2\pi\cdot k$ for some integer $k$. So from the equality of the real parts we need either $nu + n\left(\frac\pi2 - u\right) = \frac\pi 2 + 2\pi \cdot k$, in which case $n = 1 + 4k$, or we need $-nu + n\left(\frac\pi2 - u\right) = \frac\pi 2 + 2\pi \cdot k$, in which case $n$ will depend on $u$ and so the equation will not hold for all real values of $u$. Checking $n = 1 + 4k$ in the equation for the imaginary parts, we see that it works there as well, so exactly those values of $n$ congruent to $1 \pmod 4$ work. There are $\boxed{250}$ of them in the given range.

Solution 2

This problem begs us to use the familiar identity $e^{it} = \cos(t) + i \sin(t)$. Notice, $\sin(t) + i \cos(t) = i(\cos(t) - i \sin(t)) = i e^{-it}$ since $\sin(-t) = -\sin(t)$. Using this, $(\sin(t) + i \cos(t))^n = \sin(nt) + i \cos(nt)$ is recast as $(i e^{-it})^n = i e^{-itn}$. Hence we must have $i^n = i \Rightarrow i^{n-1} = 1 \Rightarrow n \equiv 1 \bmod{4}$. Thus since $1000$ is a multiple of $4$ exactly one quarter of the residues are congruent to $1$ hence we have $\boxed{250}$. 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=2005_AIME_II_Problems/Problem_9&oldid=77501"