AMC 10 · 2002 · #24

Grade 12 algebra
complex-numbersroots-of-unitycomplex-polar-form casework ↑ Prerequisites: complex-numberscomplex-polar-form
📏 Long solution 💡 4 insights
Problem
Count the ordered pairs of real numbers (a,b) for which raising a+bi to the 2002nd power gives back a-bi.

Pick an answer.

(A)
1001
(B)
1002
(C)
2001
(D)
2002
(E)
2004
How to solve
Strategy Organize Information in More Ways

Written in a and b, the equation is a pair of monstrous real polynomial equations obtained by expanding a 2002nd power — hopeless to attack directly. Two rearrangements fix that. First, a and b only ever appear in the two combinations a+bi and a-bi, so naming z = a+bi replaces two real unknowns by one complex unknown and turns the problem into z²⁰⁰² = z. Second, the conjugate is the real obstacle: it cannot be expanded, factored, or differentiated away. But a number times its conjugate collapses to |z|², a plain nonnegative real. So multiplying both sides by z converts the equation into the ordinary power equation z²⁰⁰³ = |z|², and that single multiplication is what makes the count possible. From there the size of z and the direction of z separate cleanly: the size equation has just two solutions, and each is a small subproblem. The exponent quietly becomes 2003, not 2002, which is exactly where the answer choices are trying to catch you, so the final count deserves a check on small exponents where every solution can be listed by hand.

1STEP 1

Trade two real unknowns for one complex one

Both unknowns appear only as a number and its conjugate, so set z = a+bi and the equation becomes z²⁰⁰² = z̄.

z = a+bi, z = a-bi, z²⁰⁰² = z
2STEP 2

Multiply by z to erase the conjugate

Multiplying both sides by z turns the conjugate into a real modulus: z²⁰⁰³ = |z|².

z · z²⁰⁰² = zz ⟹ z²⁰⁰³ = |z|²
3STEP 3

Let size decide first

Matching sizes gives r²(r²⁰⁰¹-1) = 0, so r = 0 or r = 1 and the rest of the plane is gone.

r²⁰⁰³ = r² ⟹ r²(r²⁰⁰¹-1) = 0 ⟹ r = 0 or r = 1
4STEP 4

Case r = 0

The size-zero case is just the origin, giving the single pair (0,0).

r = 0 ⇔ z = 0 ⇔ (a,b) = (0,0); 0²⁰⁰² = 0 = 0
5STEP 5

Case r = 1: count the 2003rd roots of unity

On the unit circle the equation reads z²⁰⁰³ = 1, whose roots number 2003.

z²⁰⁰³ = 1, z = cosθ + isinθ ⟹ θ = (2π k)/2003, k = 0,1,…,2002
6STEP 6

Add the two cases

The cases share nothing, so the total is 1 + 2003 = 2004, choice (E).

1 + 2003 = 2004
Answer
2004
Test the machinery on exponents small enough to solve by bare real algebra. With exponent 2: (a+bi)² = a²-b² + 2abi = a - bi gives a²-b² = a and 2ab = -b, that is b(2a+1) = 0. If b = 0 then a² = a, so a = 0 or a = 1; if a = -1/2 then 1/4 - b² = -1/2, so b = ±√(3)/2. That is 4 pairs, and the method above predicts 1 + 3 = 4. With exponent 3: a³ - 3ab² = a and 3a²b - b³ = -b, that is b(3a² - b² + 1) = 0. If b = 0 then a³ = a, giving a = 0, 1, -1; if b ≠ 0 then b² = 3a²+1 and substituting gives -8a³ = 4a, so a = 0 and b = ± 1. That is 5 pairs, and the method predicts 1 + 4 = 5. Both confirm the pattern that exponent n yields n+2 pairs, so exponent 2002 yields 2004. The answer list backs this up in a sly way: 2003 is not offered. A solver who correctly reaches z²⁰⁰³ = 1 but forgets the origin finds no choice to mark, which is the paper pointing at the missing solution; and 2002 is there to catch anyone who never noticed the exponent shift at all.
💡Key takeaway

When an equation mixes a number with its conjugate, multiply through by the number itself: zz collapses into a plain real square, and what is left is an ordinary power equation whose solutions you can count.

  • Trade two real unknowns for one complex one
  • Multiply by z to erase the conjugate
  • Let size decide first
  • Case r = 0
  • Case r = 1: count the 2003rd roots of unity
  • Add the two cases