Learn the idea. Try it yourself.
Read the explanation or try 6 questions with hints. Free, untimed and no sign-in needed.
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 = −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 is an index, not a power. The first term is 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 − 5 = 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 = and = + 3 + 2i. Find and .
Answer and repair route
= + 3 + 2i = 4 + i. Then = 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 = + 5. How many additions of 5 take to ? Does alone determine 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 from . In our original one-step recurrences, the rule also determines ; keep that information when you switch to paired steps.
One complex number, two real coordinates
Write = + i, with real and . The conjugate is = − 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.
For example, if = + u + vi, where u and v are fixed real numbers, then = + u and = − + v. The real part moves steadily. The imaginary part alternates about , because − = −( − ). 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:
= αC(α)z + αC(β) + β
= z + αC(β) + β.
Here |x + yi| = is the distance from the origin, so αC(α) = is a nonnegative real number. The conjugation is gone. Put r = and d = αC(β) + β. Then = r + d. The even terms start at ; the odd terms start at = T(). A paired formula must retain both starts.
If r = 1, every pair of moves adds d. Thus = + kd and = + 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 = 3 − 2i and = + 4 + 2i. Find and prove a formula for all terms.
The real part adds 4 each time, giving = 3 + 4n. For the imaginary part, = − + 2. Subtract the centre 1: − 1 = −( − 1). Since − 1 = −3, successive differences are −3, 3, −3, 3, … . Therefore = 1 − 3. The claimed formula is = 3 + 4n + [1 − 3]i.
At n = 0 it gives 3 − 2i. Substitution into the coordinate rules gives = 3 + 4(n + 1) and = 1 − 3, so the formula holds by induction. Since 11 is odd, = 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, = 0. But then = −0 + 2 = 2, so is not real. A real start alone is not enough.
Example 2. Rotation after reflection
Let = 2 + i and = i + 2 − i. Find the formulas for even and odd indices, then find .
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 = , the paired rule is = + . Also = i(2 − i) + 2 − i = 3 + i.
Consequently = (2 + k) + (1 + k)i and = (3 + k) + (1 + k)i. The starting values are correct and each pair adds , proving both formulas. With k = 10, = 12 + 11i.
Your turn 2
For this sequence, find − .
Solution
The formulas give = 13 + 11i and = 12 + 11i, so the difference is 1. Do not assume the one-step increment equals the two-step increment .
Example 3. Decide whether there is a cycle
For a fixed complex number β = u + vi, use = i + β. 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)(). If u + v = 0, that increment is zero, and every start returns after two steps. If u + v ≠ 0, suppose there were a return = with m > 0. The rule is fixed, so applying it m more times gives = = . But the paired formula gives = + m(u + v)(), which differs from . 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 = . 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() + 2 − 2i = 3 − i, and the following term returns to . 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)| = = |z|. If c ≥ 0 is real, then |cz| = = 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 || ≤ 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 = 2 + 3, starting at any complex . The fixed point is w = −3: indeed 2C(−3) + 3 = −3. If uₙ = − w = + 3, subtracting the fixed-point equation gives uₙ₊₁ = 2C(uₙ). Thus |uₙ₊₁| = 2|uₙ| and |uₙ| = |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 = 2 + 3, find when = −3 + i.
Solution
Relative to −3, the start is u₀ = i. The next two displacements are −2i and 4i. Hence = −. 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 = 1 + 2i and = . Multiplying by n + 2 gives (n + 2) = C((n + 1)), because the multiplier n + 1 is real. Define = (n + 1). The complicated rule becomes = .
Now = 1 + 2i and = 1 − 2i. Dividing back gives = and = . 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 .
Solution
Index 5 is odd, so = 1 − 2i. Since = 6, the answer is .
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 and satisfies = i + 2 − i for every integer n ≥ 0. If = 5 + 3i, find .
Hint 1
Write = x + yi with real x and y.
Hint 2
Since iC(x + yi) = y + xi, compare the two coordinates of .
Complete solution and proof check
Let = x + yi. Then = (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 = .
Substituting this into the original rule gives i() + 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 = + 2 + i for n ≥ 0, and = 6 + 3i. Find .
Hint 1
Apply the rule twice before trying to work backwards one term at a time.
Hint 2
The two-step rule is = + 4. First recover , then find .
Complete solution and proof check
Conjugating the first update and applying the rule again gives = + (2 − i) + (2 + i) = + 4. Thus = − 4 = 2 + 3i.
The first odd term is = 2 − 3i + 2 + i = 4 − 2i. Each further pair of steps adds 4.
Since 5 = 1 + 2·2, = + 8 = . As a short check, the next terms are = 6 + 3i, = 8 − 2i, = and = .
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 .
Question 3 · Level 1: A changing addition
Let = 0 and = + (n + 1)i for n ≥ 0. Find and prove formulas for and for every integer k ≥ 0.
Hint 1
The real part stays zero. Compute the imaginary parts of the first five terms.
Hint 2
Show = + i. Use = 0 and = 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 = C( + (n + 1)i) + (n + 2)i = − (n + 1)i + (n + 2)i = + i.
Starting at = 0, repeated pairs of steps give = ki. Starting at = i gives = (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, = .
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 = i + for n ≥ 0. How many initial values = x + yi, with integer x and y and + ≤ 25, make every term equal to ?
Hint 1
A constant sequence needs = 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 = x + yi. The update is (y + 1) + (x − 1)i.
It equals exactly when y = x − 1; the other coordinate equation is then automatic. The circle condition becomes + ≤ 25.
Rearranging gives − 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 .
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 = 1 and = + 2 + i for n ≥ 0. Find + + ⋯ + .
Hint 1
For = + i, the rules are = + 2 and = − + .
Hint 2
Prove = 2n + 1 and, for n ≥ 1, = n. Pair indices (0,1), (2,3), …, (18,19).
Complete solution and proof check
Write = + i with real and . Comparing real and imaginary parts gives = + 2 and = − + , with = 1 and = 0.
The real-part rule gives = 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 = n for n ≥ 1. To prove it, the formula is true at n = 1, and substituting it into the update gives = −n + = (n + 1).
Also = 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 = 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 .
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 = 2i + 1 for n ≥ 0. Find all complex starting values for which the sequence is bounded. Here bounded means that a real number M exists with || ≤ M for every n ≥ 0.
Hint 1
Find a fixed point w, then subtract w from each term.
Hint 2
Two steps give = 4 + 1 + 2i. Show − w = ( − 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 = and y = , so w = . Direct substitution confirms it is fixed.
Applying the recurrence twice gives = 4 + 1 + 2i. Since w = 4w + 1 + 2i, subtracting yields − w = 4( − w).
Induction therefore gives − w = ( − w). If ≠ w, the distance | − w| = | − w| grows without bound.
If the sequence were bounded, some fixed M would satisfy || ≤ M for every n ≥ 0. The distance inequality from the bridge would then give | − w| ≤ || + |w| ≤ M + |w| for every k.
This fixed upper bound contradicts the growing distance. Thus a bounded sequence must have = 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 = 2 + 3i and = + for n ≥ 0. Find 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 = (n + 1). The new rule is = + i, whose two-step rule is = .
Complete solution and proof check
All denominators n + 2 and n + 1 are positive, so the following scaling is reversible. Define = (n + 1).
Multiplying the original rule by n + 2 gives = (n + 1) + i = + i, because n + 1 is real. Applying this rule twice gives = .
We have = 2 + 3i and = + i = 2 − 2i. Hence = 2 + 3i and = 2 − 2i for all k ≥ 0.
Dividing by the correct index plus one gives = and = . These formulas follow by induction from the two-step rule and both initial values.
Since 99 is odd, = = .
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 = 0. For every integer k ≥ 0 use the alternating rules = + 1 and = i. Find 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 = .
Hint 2
The pair rule is = i + i. Compute four pairs, then check how the odd terms are recovered.
Complete solution and proof check
Set = . Combining the two different rules gives = iC( + 1) = i + i.
From = 0 this produces = i, = , = −1 and = 0. Four applications of the map w ↦ iw + i return every w to itself: the multiplier is = 1 and the added terms i + + + sum to 0.
Thus = for every k ≥ 0. The odd terms are always + 1, so = for every n ≥ 0.
The first eight terms are 0, 1, i, , , −i, −1, 0. Since 2027 = 8·253 + 3, = = .
Although = = 0, the next rules differ: from index 0 the first rule gives = 1; from index 7 the second rule gives = 0. A period of 7 would require = , 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 versus 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 from the original rule.
- Confusing a fixed point with a two-cycle: = does not force = .
- Changing the index origin: through 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.