Skip to main content

2005 AMC 12B Problem 22

Problem 22 of 25HarderAlgebra

A sequence of complex numbers z0,z_0, z1,z_1, z2,z_2, \ldots is defined by the rule zn+1=iznzn, z_{n+1} = \dfrac{i z_n}{\overline{z_n}}, where zn\overline{z_n} is the complex conjugate of znz_n and i2=1.i^2 = -1. Suppose that z0=1|z_0| = 1 and z2005=1.z_{2005} = 1. How many possible values are there for z0?z_0?

Answer choices

Show solution

Solution

Because z0=1,|z_0| = 1, every zn=1,|z_n| = 1, so zn=1zn\overline{z_n} = \dfrac{1}{z_n} and zn+1=iznzn=izn2. z_{n+1} = \dfrac{i z_n}{\overline{z_n}} = i z_n^2. Iterating, z1=iz02z_1 = i z_0^2 and z2=i(iz02)2=iz04.z_2 = i(i z_0^2)^2 = -i z_0^4. Moreover, if zn=iz02n,z_n=-i z_0^{2^n}, then zn+1=i(i)2z02n+1=iz02n+1.z_{n+1}=i(-i)^2z_0^{2^{n+1}}=-i z_0^{2^{n+1}}. Thus zn=iz02nz_n=-i z_0^{2^n} for every n2.n\ge2. The condition z2005=1z_{2005} = 1 is therefore z022005=i.z_0^{2^{2005}} = i. Every nonzero complex equation z0N=iz_0^{N} = i has exactly NN distinct solutions, all on the unit circle. Here N=22005,N = 2^{2005}, so there are 220052^{2005} possible values for z0.z_0. Thus, the correct answer is E.

More practice

Concepts: complex number · roots of unity · recursion

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.