Learn the idea. Try it yourself.

Read the explanation or try 6 questions with hints. Free, untimed and no sign-in needed.

Read the lessonStart practising →

Original algebra lesson: a recurrence tells you how to get the next term. When the rule contains a complex conjugate, the useful pattern often appears after two moves. This lesson extends complex-number foundations and second-order recurrences by making you choose between coordinates, paired steps and a change of scale.

Your goal: derive and prove a formula for a conjugate recurrence, handle even and odd indices correctly, and recognise when a repeated value does not establish a cycle.

Preparation context: this is original practice for students developing the algebra needed for China’s national high-school mathematics league. An organiser-hosted 2015 first-test paper provides historical topic calibration only. This page is not an official paper, an endorsed resource, a full syllabus or a claim about the exact 2026 format. The final boundedness and alternating-rule problems are proof extensions. The ideas are available to students in every country.

Before you start: you should be able to expand brackets, use i2i^{2} = −1, and work with real and imaginary parts. Review mathematical induction if a formula checked at three values still feels like a proof. No characteristic-root method is needed here.

Study route: allow 45–60 minutes for the starting checks, Examples 1–3 and Questions 1–6. Take the two bridge examples and Questions 7–9 in a second sitting. These are flexible study estimates and lesson difficulty labels, not official exam timings. Write your reasoning before opening a solution.

Three starting checks

Throughout this lesson C(z) means the complex conjugate of z. Thus C(x + yi) = x − yi for real x and y. The subscript in znz_{n} is an index, not a power. The first term is z0z_{0} unless a problem explicitly says otherwise.

D1. Which sign changes?

Find C(−2 + 5i) and iC(−2 + 5i).

Answer and repair route

C(−2 + 5i) = −2 − 5i. Multiplying by i gives −2i − 5i2i^{2} = 5 − 2i. Only the imaginary part changes under conjugation; multiplying by i is a separate operation. If this was uncertain, revisit the complex-number bridge before continuing.

D2. Which constant is conjugated?

Let z0z_{0} = 1+i1 + i and zn+1z_{n+1} = C⁡(zn)\operatorname{C}(z_{n}) + 3 + 2i. Find z1z_{1} and z2z_{2}.

Answer and repair route

z1z_{1} = 1−i1 - i + 3 + 2i = 4 + i. Then z2z_{2} = 4 − i + 3 + 2i = 7 + i. At each step conjugate the whole preceding term, then add the new constant. Writing two separate lines helps prevent carrying the wrong sign.

D3. Count the moves

A two-step relation says zn+2z_{n+2} = znz_{n} + 5. How many additions of 5 take z0z_{0} to z10z_{10}? Does z0z_{0} alone determine z11z_{11} from this relation?

Answer and repair route

Five additions take index 0 to index 10: 0 → 2 → 4 → 6 → 8 → 10. The relation alone does not connect even and odd indices, so it does not determine z11z_{11} from z0z_{0}. In our original one-step recurrences, the rule also determines z1z_{1}; keep that information when you switch to paired steps.

One complex number, two real coordinates

Write znz_{n} = ana_{n} + bnb_{n}i, with real ana_{n} and bnb_{n}. The conjugate is C⁡(zn)\operatorname{C}(z_{n}) = ana_{n} − bnb_{n}i. On the complex plane it is the reflection across the real axis: the horizontal coordinate stays the same, while the vertical coordinate changes sign.

Conjugation reflects a point across the real axisThe point 2 plus i has coordinates 2, 1. Its conjugate 2 minus i has coordinates 2, minus 1. Both have real coordinate 2 and are equally far from the real axis.2 + i2 − iRealImaginary021−1
Conjugation changes the sign of the vertical coordinate. The dashed lines only show coordinates.

For example, if zn+1z_{n+1} = C⁡(zn)\operatorname{C}(z_{n}) + u + vi, where u and v are fixed real numbers, then an+1a_{n+1} = ana_{n} + u and bn+1b_{n+1} = −bnb_{n} + v. The real part moves steadily. The imaginary part alternates about v2\frac{v}{2}, because bn+1b_{n+1} − v2\frac{v}{2} = −(bnb_{n} − v2\frac{v}{2}). This is a reason to inspect two successive moves.

Why two moves remove the conjugate

Conjugation obeys C(C(z)) = z, C(z + w) = C(z) + C(w), and C(zw) = C(z)C(w). These follow by expanding real and imaginary parts. Consider a fixed rule T(z) = αC(z) + β, with complex constants α and β. Substitute the entire first update into the next:

T(T(z)) = αC(αC(z) + β) + β
= αC(α)z + αC(β) + β
= ∣α∣2|\alpha|^2z + αC(β) + β.

Here |x + yi| = x2+y2\sqrt{x^2+y^2} is the distance from the origin, so αC(α) = ∣α∣2|\alpha|^2 is a nonnegative real number. The conjugation is gone. Put r = ∣α∣2|\alpha|^2 and d = αC(β) + β. Then zn+2z_{n+2} = rznz_{n} + d. The even terms start at z0z_{0}; the odd terms start at z1z_{1} = T(z0z_{0}). A paired formula must retain both starts.

If r = 1, every pair of moves adds d. Thus z2kz_{2k} = z0z_{0} + kd and z2k+1z_{2k+1} = z1z_{1} + kd for every integer k ≥ 0. At k = 0 the two formulas give their stated starting values; the two-step rule adds d when k increases by 1. This is a complete induction proof. If d = 0, two steps return every term to itself, although some starting values may already be fixed after one step.

Choice of method: use coordinates when the question constrains a real or imaginary part. Use paired steps when conjugation makes the signs alternate. If the coefficients depend on n, inspect the index pattern before using a constant-rule formula.

Worked examples with nearby practice

Example 1. Separate the coordinates

Let z0z_{0} = 3 − 2i and zn+1z_{n+1} = C⁡(zn)\operatorname{C}(z_{n}) + 4 + 2i. Find z11z_{11} and prove a formula for all terms.

The real part adds 4 each time, giving ana_{n} = 3 + 4n. For the imaginary part, bn+1b_{n+1} = −bnb_{n} + 2. Subtract the centre 1: bn+1b_{n+1} − 1 = −(bnb_{n} − 1). Since b0b_{0} − 1 = −3, successive differences are −3, 3, −3, 3, … . Therefore bnb_{n} = 1 − 3(−1)n(-1)^{n}. The claimed formula is znz_{n} = 3 + 4n + [1 − 3(−1)n(-1)^{n}]i.

At n = 0 it gives 3 − 2i. Substitution into the coordinate rules gives an+1a_{n+1} = 3 + 4(n + 1) and bn+1b_{n+1} = 1 − 3(−1)n+1(-1)^{n+1}, so the formula holds by induction. Since 11 is odd, z11z_{11} = 47 + 4i.

Your turn 1

For the same rule, which starting values make every term real?

Solution

There are none. If all terms are real, b0b_{0} = 0. But then b1b_{1} = −0 + 2 = 2, so z1z_{1} is not real. A real start alone is not enough.

Example 2. Rotation after reflection

Let z0z_{0} = 2 + i and zn+1z_{n+1} = iC⁡(zn)\operatorname{C}(z_{n}) + 2 − i. Find the formulas for even and odd indices, then find z20z_{20}.

The coordinate identity iC(x + yi) = y + xi is a reflection followed by a quarter-turn. Rather than repeat that calculation twenty times, use α = i and β = 2 − i. Since |i|² = 1 and iC(2 − i) + 2 − i = i(2 + i) + 2 − i = 1+i1 + i, the paired rule is zn+2z_{n+2} = znz_{n} + 1+i1 + i. Also z1z_{1} = i(2 − i) + 2 − i = 3 + i.

Consequently z2kz_{2k} = (2 + k) + (1 + k)i and z2k+1z_{2k+1} = (3 + k) + (1 + k)i. The starting values are correct and each pair adds 1+i1 + i, proving both formulas. With k = 10, z20z_{20} = 12 + 11i.

Your turn 2

For this sequence, find z21z_{21} − z20z_{20}.

Solution

The formulas give z21z_{21} = 13 + 11i and z20z_{20} = 12 + 11i, so the difference is 1. Do not assume the one-step increment equals the two-step increment 1+i1 + i.

Example 3. Decide whether there is a cycle

For a fixed complex number β = u + vi, use zn+1z_{n+1} = iC⁡(zn)\operatorname{C}(z_{n}) + β. For which real u and v can a term return to its starting value after a positive number of steps?

The paired increment is iC(β) + β = (u + v)(1+i1 + i). If u + v = 0, that increment is zero, and every start returns after two steps. If u + v ≠ 0, suppose there were a return zmz_{m} = z0z_{0} with m > 0. The rule is fixed, so applying it m more times gives z2mz_{2m} = zmz_{m} = z0z_{0}. But the paired formula gives z2mz_{2m} = z0z_{0} + m(u + v)(1+i1 + i), which differs from z0z_{0}. This contradiction excludes a return. Thus u + v = 0 is necessary and sufficient.

In the return case β = u − ui, a one-step fixed point satisfies x = y + u. Every point on that line is stationary; other points move in a two-term cycle. The phrase “period at most two” includes stationary sequences.

Your turn 3

Take β = 2 − 2i and z0z_{0} = 1+i1 + i. Is the sequence stationary or a genuine two-term cycle?

Solution

A stationary point needs x − y = 2; here x − y = 0. The next term is i(1−i1 - i) + 2 − 2i = 3 − i, and the following term returns to 1+i1 + i. It is a genuine two-term cycle.

Two bridges before the proof challenges

Distance rules for the next challenge

For z = x + yi, conjugation preserves distance from the origin: |C(z)| = x2+(−y)2\sqrt{x^2+(-y)^2} = |z|. If c ≥ 0 is real, then |cz| = c2x2+c2y2\sqrt{c^2x^2+c^2y^2} = c|z|. Thus multiplying by a positive real number scales the distance by that number.

A sequence is bounded if one real number M satisfies |znz_{n}| ≤ M for every n ≥ 0. Geometrically, all its points fit inside one fixed circle centred at 0. We also use the distance inequality |z − w| ≤ |z| + |w|. The direct distance from w to z cannot exceed the route w → 0 → z, by the ordinary triangle inequality. Equality is allowed when the points lie on a line. These facts explain the growth argument below.

Example 4. Subtract a fixed point before discussing growth

Consider zn+1z_{n+1} = 2C⁡(zn)\operatorname{C}(z_{n}) + 3, starting at any complex z0z_{0}. The fixed point is w = −3: indeed 2C(−3) + 3 = −3. If uₙ = znz_{n} − w = znz_{n} + 3, subtracting the fixed-point equation gives uₙ₊₁ = 2C(uₙ). Thus |uₙ₊₁| = 2|uₙ| and |uₙ| = 2n2^{n}|u₀|.

If u₀ = 0, the sequence stays at −3. Otherwise its distance from −3 grows without bound. A sequence staying in any fixed circle about the origin also stays within a fixed distance of −3, since |z + 3| ≤ |z| + 3. So every other start is unbounded. This last argument connects growth about a fixed point with the definition of boundedness about the origin; it must not be omitted.

Your turn 4

For zn+1z_{n+1} = 2C⁡(zn)\operatorname{C}(z_{n}) + 3, find z2z_{2} when z0z_{0} = −3 + i.

Solution

Relative to −3, the start is u₀ = i. The next two displacements are −2i and 4i. Hence z2z_{2} = −3+4i3 + 4i. The real part remains at the fixed-point coordinate, while the imaginary distance doubles at each step.

Example 5. A changing coefficient suggests a changing unit

Suppose z0z_{0} = 1 + 2i and zn+1z_{n+1} = n+1n+2\frac{n+1}{n+2}C⁡(zn)\operatorname{C}(z_{n}). Multiplying by n + 2 gives (n + 2)zn+1z_{n+1} = C((n + 1)znz_{n}), because the multiplier n + 1 is real. Define wnw_{n} = (n + 1)znz_{n}. The complicated rule becomes wn+1w_{n+1} = C⁡(wn)\operatorname{C}(w_{n}).

Now w2kw_{2k} = 1 + 2i and w2k+1w_{2k+1} = 1 − 2i. Dividing back gives z2kz_{2k} = 1+2i2k+1\frac{1+2i}{2k+1} and z2k+1z_{2k+1} = 1−2i2k+2\frac{1-2i}{2k+2}. Each denominator is positive. A formula for w is not yet a formula for z; the final division is part of the solution.

Your turn 5

For this example, find z5z_{5}.

Solution

Index 5 is odd, so w5w_{5} = 1 − 2i. Since w5w_{5} = 6z5z_{5}, the answer is 1−2i6\frac{1-2i}{6}.

When the instructions alternate

The two-step identity for T(T(z)) assumes the same map T at every move. If one rule is A and the next is B, follow pairs as B(A(z)). A return to a previous value is not enough if a different rule comes next. Question 9 asks you to track both the value and this phase of the instructions. Start by writing the two rules on separate lines.

Practise, review, then return to your paper

Start six-question practice or work through the nine written problems below. The adaptive checks assess selected answers; they do not automatically grade your written proofs. A session finishes after six responses, including any requested solutions. Finishing a session is not proof of mastery. Rework a solution-assisted problem later without looking at its method.

If a sign error appears, return to D1. If even and odd indices were mixed, revisit Example 2. If a proof jumps from observed terms to all terms, check the base and the recurrence. After practice, use the return-to-paper option when you arrived from a paper, and retry one question that uses the same idea. Students entering directly can continue with China’s selection and preparation guide or the lesson library.

Try six questions with hints and feedback

Choose a starting level below. You can use hints, retry a mistake or ask for a solution. A session ends after six responses, including requested solutions; it does not grade your written proofs or establish mastery.

Interactive practice loads here. You can also use the complete question set below.

Nine original graded problems

C(z) denotes conjugation in every problem. Levels 1, 2 and 3 indicate progression inside this lesson. The first tier bridges to the method, the middle tier combines constraints, and the final tier asks for proof and transfer.

Question 1 · Level 1: Work backwards from one step

A sequence starts at an unknown complex number z0z_{0} and satisfies zn+1z_{n+1} = iC⁡(zn)\operatorname{C}(z_{n}) + 2 − i for every integer n ≥ 0. If z1z_{1} = 5 + 3i, find z0z_{0}.

Hint 1

Write z0z_{0} = x + yi with real x and y.

Hint 2

Since iC(x + yi) = y + xi, compare the two coordinates of z1z_{1}.

Complete solution and proof check

Let z0z_{0} = x + yi. Then z1z_{1} = (y + 2) + (x − 1)i.

Equality of complex numbers means equality of their real and imaginary parts, so y + 2 = 5 and x − 1 = 3. Hence y = 3 and x = 4, giving z0z_{0} = 4+3i4 + 3i.

Substituting this into the original rule gives i(4−3i4 - 3i) + 2 − i = 5 + 3i, as required. The two coordinate equations determine x and y uniquely.

Self-check:

  • Introduce both real coordinates.
  • Compare real and imaginary parts separately.
  • Check the recovered value in the original rule.

Question 2 · Level 1: Recover the start, then choose the parity

A sequence satisfies zn+1z_{n+1} = C⁡(zn)\operatorname{C}(z_{n}) + 2 + i for n ≥ 0, and z2z_{2} = 6 + 3i. Find z5z_{5}.

Hint 1

Apply the rule twice before trying to work backwards one term at a time.

Hint 2

The two-step rule is zn+2z_{n+2} = znz_{n} + 4. First recover z0z_{0}, then find z1z_{1}.

Complete solution and proof check

Conjugating the first update and applying the rule again gives zn+2z_{n+2} = znz_{n} + (2 − i) + (2 + i) = znz_{n} + 4. Thus z0z_{0} = z2z_{2} − 4 = 2 + 3i.

The first odd term is z1z_{1} = 2 − 3i + 2 + i = 4 − 2i. Each further pair of steps adds 4.

Since 5 = 1 + 2·2, z5z_{5} = z1z_{1} + 8 = 12−2i12 - 2i. As a short check, the next terms are z2z_{2} = 6 + 3i, z3z_{3} = 8 − 2i, z4z_{4} = 10+3i10 + 3i and z5z_{5} = 12−2i12 - 2i.

Self-check:

  • Derive the two-step rule, including both constants.
  • Use the given index 2 to recover index 0.
  • Start the odd-index chain at z1z_{1}.

Question 3 · Level 1: A changing addition

Let z0z_{0} = 0 and zn+1z_{n+1} = C⁡(zn)\operatorname{C}(z_{n}) + (n + 1)i for n ≥ 0. Find z100z_{100} and prove formulas for z2kz_{2k} and z2k+1z_{2k+1} for every integer k ≥ 0.

Hint 1

The real part stays zero. Compute the imaginary parts of the first five terms.

Hint 2

Show zn+2z_{n+2} = znz_{n} + i. Use z0z_{0} = 0 and z1z_{1} = i as the two starting values.

Complete solution and proof check

All terms are purely imaginary because both conjugation and addition of a purely imaginary number preserve that property. Applying the rule twice gives zn+2z_{n+2} = C(C⁡(zn)\operatorname{C}(z_{n}) + (n + 1)i) + (n + 2)i = znz_{n} − (n + 1)i + (n + 2)i = znz_{n} + i.

Starting at z0z_{0} = 0, repeated pairs of steps give z2kz_{2k} = ki. Starting at z1z_{1} = i gives z2k+1z_{2k+1} = (k + 1)i.

To make this a proof, the formulas hold at k = 0; the two-step rule adds i to both formulas when k increases by 1. Hence they hold for every k ≥ 0 by induction.

Since 100 = 2·50, z100z_{100} = 50i50i.

Self-check:

  • Keep the n + 1 and n + 2 additions distinct.
  • Give both parity formulas with k ≥ 0.
  • Check both bases and explain the inductive step.

Question 4 · Level 2: A sum can lose information

Let T(z) = iC(z) + 1 + 2i. How many complex numbers z = x + yi with nonnegative integer coordinates x and y satisfy z + T(z) = 7 + 8i?

Hint 1

Find the coordinates of T(x + yi), then add the original coordinates.

Hint 2

Both resulting equations reduce to x + y = 6. Count the permitted ordered pairs.

Complete solution and proof check

T(x + yi) = (y + 1) + (x + 2)i. Therefore z + T(z) = (x + y + 1) + (x + y + 2)i.

Comparing with 7 + 8i gives x + y = 6 from both parts. There are exactly seven nonnegative integer pairs: x can be any integer from 0 to 6, and y is then forced to be 6 − x.

Every one gives the required sum. Thus there are 7 solutions.

The two displayed coordinate equations are the same restriction; they do not determine one unique starting number.

Self-check:

  • Expand T with the correct swapped coordinates.
  • Recognise that the two conditions are identical.
  • Count all seven allowed x values and verify y is permitted.

Question 5 · Level 2: Stationary points inside a circle

A sequence satisfies zn+1z_{n+1} = iC⁡(zn)\operatorname{C}(z_{n}) + 1−i1 - i for n ≥ 0. How many initial values z0z_{0} = x + yi, with integer x and y and x2x^{2} + y2y^{2} ≤ 25, make every term equal to z0z_{0}?

Hint 1

A constant sequence needs z0z_{0} = iC⁡(z0)\operatorname{C}(z_{0}) + 1−i1 - i.

Hint 2

The fixed-point equation is y = x − 1. Substitute this into the circle inequality and factor.

Complete solution and proof check

Write z0z_{0} = x + yi. The update is (y + 1) + (x − 1)i.

It equals z0z_{0} exactly when y = x − 1; the other coordinate equation is then automatic. The circle condition becomes x2x^{2} + (x−1)2(x - 1)^{2} ≤ 25.

Rearranging gives x2x^{2} − x − 12 ≤ 0, or (x − 4)(x + 3) ≤ 0. Between −3 and 4, x + 3 ≥ 0 and x − 4 ≤ 0, so their product is nonpositive.

If x < −3 both factors are negative, and if x > 4 both are positive, so the product is positive outside this interval. At the two endpoints it is zero.

Therefore the inequality holds precisely on −3 ≤ x ≤ 4, with both endpoints included. Hence the integer choices are −3, −2, −1, 0, 1, 2, 3, 4: eight choices.

Each gives the integer y = x − 1 and lies in the circle, including the boundary choices. Being fixed by the rule is enough to make all later terms equal to z0z_{0}.

Self-check:

  • Impose the fixed-point condition rather than just a two-step return.
  • Substitute into the inequality with both squares.
  • Include both boundary integers and verify sufficiency.

Question 6 · Level 2: Sum a sequence with alternating drift

Let z0z_{0} = 1 and zn+1z_{n+1} = C⁡(zn)\operatorname{C}(z_{n}) + 2 + (−1)n(-1)^{n}i for n ≥ 0. Find z0z_{0} + z1z_{1} + ⋯ + z19z_{19}.

Hint 1

For znz_{n} = ana_{n} + bnb_{n}i, the rules are an+1a_{n+1} = ana_{n} + 2 and bn+1b_{n+1} = −bnb_{n} + (−1)n(-1)^{n}.

Hint 2

Prove ana_{n} = 2n + 1 and, for n ≥ 1, bnb_{n} = (−1)n−1(-1)^{n-1}n. Pair indices (0,1), (2,3), …, (18,19).

Complete solution and proof check

Write znz_{n} = ana_{n} + bnb_{n}i with real ana_{n} and bnb_{n}. Comparing real and imaginary parts gives an+1a_{n+1} = ana_{n} + 2 and bn+1b_{n+1} = −bnb_{n} + (−1)n(-1)^{n}, with a0a_{0} = 1 and b0b_{0} = 0.

The real-part rule gives ana_{n} = 2n + 1, since each step adds 2. The first imaginary coordinates are 0, 1, −2, 3, −4; their magnitudes suggest n, and the sign is positive for odd n and negative for even n.

This suggests bnb_{n} = (−1)n−1(-1)^{n-1}n for n ≥ 1. To prove it, the formula is true at n = 1, and substituting it into the update gives bn+1b_{n+1} = −(−1)n−1(-1)^{n-1}n + (−1)n(-1)^{n} = (−1)n(-1)^{n}(n + 1).

Also b0b_{0} = 0. Pair consecutive indices 2j and 2j + 1 for j = 0,…,9.

Their imaginary parts are −2j and 2j + 1, so each pair contributes i. For the real total, summing ana_{n} = 2n + 1 over the twenty indices gives 20 + 2(0 + 1 + ⋯ + 19).

Pair 0 with 19, 1 with 18, and so on up to 9 with 10. There are ten pairs, each totalling 19, so 0 + 1 + ⋯ + 19 = 190.

Thus the real total is 20 + 2·190 = 400. The required sum is 400+10i400 + 10i.

There are twenty terms because the index begins at 0.

Self-check:

  • Derive and verify the imaginary-part formula.
  • Count twenty terms, not nineteen.
  • Pair the correct consecutive indices before summing.

Question 7 · Level 3: The only bounded starting value

Let zn+1z_{n+1} = 2iC⁡(zn)\operatorname{C}(z_{n}) + 1 for n ≥ 0. Find all complex starting values z0z_{0} for which the sequence is bounded. Here bounded means that a real number M exists with |znz_{n}| ≤ M for every n ≥ 0.

Hint 1

Find a fixed point w, then subtract w from each term.

Hint 2

Two steps give zn+2z_{n+2} = 4znz_{n} + 1 + 2i. Show z2kz_{2k} − w = 4k4^{k}(z0z_{0} − w).

Complete solution and proof check

A fixed point w = x + yi satisfies w = 2iC(w) + 1 = (2y + 1) + 2xi. Thus x = 2y + 1 and y = 2x.

Solving gives x = −13-\frac{1}{3} and y = −23-\frac{2}{3}, so w = −1+2i3-\frac{1+2i}{3}. Direct substitution confirms it is fixed.

Applying the recurrence twice gives zn+2z_{n+2} = 4znz_{n} + 1 + 2i. Since w = 4w + 1 + 2i, subtracting yields zn+2z_{n+2} − w = 4(znz_{n} − w).

Induction therefore gives z2kz_{2k} − w = 4k4^{k}(z0z_{0} − w). If z0z_{0} ≠ w, the distance |z2kz_{2k} − w| = 4k4^{k}|z0z_{0} − w| grows without bound.

If the sequence were bounded, some fixed M would satisfy |znz_{n}| ≤ M for every n ≥ 0. The distance inequality from the bridge would then give |z2kz_{2k} − w| ≤ |z2kz_{2k}| + |w| ≤ M + |w| for every k.

This fixed upper bound contradicts the growing distance. Thus a bounded sequence must have z0z_{0} = w.

Conversely, that start gives the constant sequence w, which is bounded. It is the only starting value.

Self-check:

  • Find and check the fixed point.
  • Prove the formula on even indices.
  • Explain why growth of distance rules out boundedness.
  • Show the proposed start really gives a bounded sequence.

Question 8 · Level 3: Remove the changing scale

Let z0z_{0} = 2 + 3i and zn+1z_{n+1} = n+1n+2\frac{n+1}{n+2}C⁡(zn)\operatorname{C}(z_{n}) + in+2\frac{i}{n+2} for n ≥ 0. Find z99z_{99} and prove formulas for both the even and odd terms.

Hint 1

Multiply the update by n + 2. Which expression then appears at both consecutive indices?

Hint 2

Set wnw_{n} = (n + 1)znz_{n}. The new rule is wn+1w_{n+1} = C⁡(wn)\operatorname{C}(w_{n}) + i, whose two-step rule is wn+2w_{n+2} = wnw_{n}.

Complete solution and proof check

All denominators n + 2 and n + 1 are positive, so the following scaling is reversible. Define wnw_{n} = (n + 1)znz_{n}.

Multiplying the original rule by n + 2 gives wn+1w_{n+1} = (n + 1)C⁡(zn)\operatorname{C}(z_{n}) + i = C⁡(wn)\operatorname{C}(w_{n}) + i, because n + 1 is real. Applying this rule twice gives wn+2w_{n+2} = wnw_{n}.

We have w0w_{0} = 2 + 3i and w1w_{1} = C⁡(w0)\operatorname{C}(w_{0}) + i = 2 − 2i. Hence w2kw_{2k} = 2 + 3i and w2k+1w_{2k+1} = 2 − 2i for all k ≥ 0.

Dividing by the correct index plus one gives z2kz_{2k} = 2+3i2k+1\frac{2+3i}{2k+1} and z2k+1z_{2k+1} = 2−2i2k+2\frac{2-2i}{2k+2}. These formulas follow by induction from the two-step rule and both initial values.

Since 99 is odd, z99z_{99} = 2−2i100\frac{2-2i}{100} = 1−i50\frac{1-i}{50}.

Self-check:

  • Define a scaling that uses the current index plus one.
  • Explain why conjugation commutes with a real multiplier.
  • Give both parity formulas and their bases.
  • Divide by 100 at index 99.

Question 9 · Level 3: The value alone does not remember the phase

Start with z0z_{0} = 0. For every integer k ≥ 0 use the alternating rules z2k+1z_{2k+1} = C⁡(z2k)\operatorname{C}(z_{2k}) + 1 and z2k+2z_{2k+2} = iC⁡(z2k+1)\operatorname{C}(z_{2k+1}). Find z2027z_{2027} and explain why a return to 0 at index 7 does not prove a period of 7.

Hint 1

Follow every pair of moves by setting wkw_{k} = z2kz_{2k}.

Hint 2

The pair rule is wk+1w_{k+1} = iwkw_{k} + i. Compute four pairs, then check how the odd terms are recovered.

Complete solution and proof check

Set wkw_{k} = z2kz_{2k}. Combining the two different rules gives wk+1w_{k+1} = iC(C⁡(wk)\operatorname{C}(w_{k}) + 1) = iwkw_{k} + i.

From w0w_{0} = 0 this produces w1w_{1} = i, w2w_{2} = −1+i-1 + i, w3w_{3} = −1 and w4w_{4} = 0. Four applications of the map w ↦ iw + i return every w to itself: the multiplier is i4i^{4} = 1 and the added terms i + i2i^{2} + i3i^{3} + i4i^{4} sum to 0.

Thus wk+4w_{k+4} = wkw_{k} for every k ≥ 0. The odd terms are always C⁡(wk)\operatorname{C}(w_{k}) + 1, so zn+8z_{n+8} = znz_{n} for every n ≥ 0.

The first eight terms are 0, 1, i, 1−i1 - i, −1+i-1 + i, −i, −1, 0. Since 2027 = 8·253 + 3, z2027z_{2027} = z3z_{3} = 1−i1 - i.

Although z7z_{7} = z0z_{0} = 0, the next rules differ: from index 0 the first rule gives z1z_{1} = 1; from index 7 the second rule gives z8z_{8} = 0. A period of 7 would require z8z_{8} = z1z_{1}, which is false.

With alternating instructions, the state must include which rule comes next.

Self-check:

  • Combine the two different rules in the right order.
  • Prove the pair cycle, not merely observe one return.
  • Recover odd indices and reduce 2027 modulo 8.
  • Give the explicit z8z_{8} versus z1z_{1} countercheck to period 7.

Common mistakes and repairs

  • Changing both signs under conjugation: C(x + yi) = x − yi. The real coordinate does not change.
  • Conjugating only part of an update: in C(αC(z) + β), both α and β are conjugated.
  • Losing the odd starting value: a paired rule has two chains. Calculate z1z_{1} from the original rule.
  • Confusing a fixed point with a two-cycle: z2z_{2} = z0z_{0} does not force z1z_{1} = z0z_{0}.
  • Changing the index origin: z0z_{0} through z19z_{19} contains twenty terms.
  • Using a repeated value without the rule phase: alternating instructions require the next rule to match as well.
  • Calling observations a proof: check both starting values and use a recurrence or induction that covers every later index.

Explain the method in your own words

Without reopening the theory, explain why applying T(z) = αC(z) + β twice removes conjugation, and why two starting values appear afterwards even though the original rule needs only one. Then choose one problem you solved with a hint and retry it from a blank page.

Next step: return to second-order recurrences to compare two-step chains with a recurrence using two preceding terms. If the calculations were the main obstacle, practise complex-number foundations first.

Preparation context and sources

The Anhui Mathematical Society’s 2015 national league paper archive was used only to calibrate historical topic coverage. All examples, exercises, explanations and the diagram on this page were created for this lesson; no official problem is reproduced or translated. Historical paper coverage does not establish the current syllabus or permitted aids. Use the China guide and its organiser links to check current selection information. There is no affiliation with or endorsement by the contest organisers.