Difference between revisions of "2005 AMC 12B Problems/Problem 22"
Fuzzy growl (talk | contribs) (→See also) |
|||
Line 16: | Line 16: | ||
== Solution == | == Solution == | ||
+ | Since <math>|z_0|=1</math>, let <math>z_0=e^{i\theta_0}</math>, where <math>\theta_0</math> is an [[argument]] of <math>z_0</math>. | ||
+ | I will prove by induction that <math>z_n=e^{i\theta_n}</math>, where <math>\theta_n=2^n(\theta_0+\frac{\pi}{2})-\frac{\pi}{2}</math>. | ||
+ | Base Case: trivial | ||
+ | |||
+ | Inductive Step: Suppose the formula is correct for <math>z_k</math>, then | ||
+ | <cmath> | ||
+ | z_{k+1}=\frac{iz_k}{\overline {z_k}}=i e^{i\theta_k} e^{i\theta_k}=e^{i(2\theta_k+\pi/2)} | ||
+ | </cmath> | ||
+ | Since | ||
+ | <cmath> | ||
+ | 2\theta_k+\frac{\pi}{2}=2\cdot 2^n(\theta_0+\frac{\pi}{2})-\pi+\frac{\pi}{2}=2^{n+1}(\theta_0+\frac{\pi}{2})-\frac{\pi}{2}=\theta_{n+1} | ||
+ | </cmath> | ||
+ | the formula is proven | ||
+ | |||
+ | <math>z_{2005}=1\Rightarrow \theta_{2005}=2k\pi</math>, where <math>k</math> is an integer. Therefore, | ||
+ | <cmath> | ||
+ | 2^{2005}(\theta_0+\frac{\pi}{2})=(2k+\frac{1}{2})\pi\\ | ||
+ | \theta_0=\frac{k}{2^{2004}}\pi+\left(\frac{1}{2^{2006}}-\frac{1}{2}\right)\pi | ||
+ | </cmath> | ||
+ | The value of <math>\theta_0</math> only matters modulo <math>2\pi</math>. Since <math>\frac{k+2^{2005}}{2^{2004}}\pi\equiv\frac{k}{2^{2004}}\pi\mod 2\pi</math>, k only needs to take values from 0 to <math>2^{2005}-1</math>, so the answer is <math>2^{2005}\Rightarrow\boxed{E}</math> | ||
== See Also == | == See Also == | ||
{{AMC12 box|year=2005|ab=B|num-b=21|num-a=23}} | {{AMC12 box|year=2005|ab=B|num-b=21|num-a=23}} |
Revision as of 00:41, 16 September 2012
Problem
A sequence of complex numbers is defined by the rule
where is the complex conjugate of and . Suppose that and . How many possible values are there for ?
Solution
Since , let , where is an argument of . I will prove by induction that , where .
Base Case: trivial
Inductive Step: Suppose the formula is correct for , then Since the formula is proven
, where is an integer. Therefore, The value of only matters modulo . Since , k only needs to take values from 0 to , so the answer is
See Also
2005 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 21 |
Followed by Problem 23 |
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 |