Skipping the initial statement
Without the chain never starts. The false claim has a valid inductive step, yet it is false for every . Always evaluate both sides at the first value and write " is true".
Specialist Mathematics · Unit 3 · Topic 2
Prove results for every positive integer by mathematical induction (sums in sigma notation, divisibility and De Moivre's theorem), then prove multi-angle identities such as with De Moivre's theorem.
See why checking examples is never enough, and how an initial statement, an assumption and an inductive step together prove a statement for every positive integer.
Read, write and evaluate sums in sigma notation, count their terms, and split off the last term, which is the move every induction proof about a sum depends on.
Prove a formula for a sum for every positive integer n by splitting off the last term, using the assumption on the rest and factorising towards the target.
Prove that an expression is divisible by a given integer for every positive integer n, by writing the assumption as an equation with an integer multiple and substituting it.
Prove De Moivre's theorem for positive integer powers by induction, using and the angle sum identities in the inductive step.
Expand with the binomial theorem and equate its real and imaginary parts with to prove identities for angles up to .
Use the identities for cos(3x), sin(3x), cos(4x) and tan(3x) to find exact values, solve trigonometric and cubic equations, and rewrite powers of sine and cosine.
Ten questions across the topic, from foundation to complex unfamiliar. Your results feed your mastery.
Some statements are about every positive integer at once: a formula for , the claim that is always a multiple of , or De Moivre's theorem for every power . Checking cases can never prove them, because there are infinitely many cases. Mathematical induction can: prove the first case, prove that each case forces the next, and every case follows.
In this topic you will write induction proofs the way QCAA expects them, with an initial statement, an assumption statement, an inductive step and a conclusion, for sums written in sigma notation, for divisibility, and for De Moivre's theorem itself. Then you will combine De Moivre's theorem with the binomial theorem to prove identities like in a few lines, and use them to find exact values and solve equations.
Builds on Introduction to proof, Complex arithmetic and algebra, Trigonometry and functions and Further complex numbers.
Subject matter from the Specialist Mathematics General senior syllabus 2025 v1.4 (opens in a new tab), CC BY 4.0 © State of Queensland (QCAA).
The focus areas you can practise on their own. Each one maps to dot points above.
Structure of an induction proof
Write and recognise the initial statement, assumption statement, inductive step and conclusion, and explain why each one is needed.
Sigma notation
Expand, evaluate and write sums in sigma notation, count their terms and split off the last term.
Proving sum formulas by induction
Prove a formula for a sum for every positive integer n by mathematical induction.
Proving divisibility by induction
Prove that an expression is divisible by a given integer for every positive integer n by mathematical induction.
Proving De Moivre's theorem
Prove (r cis θ)ⁿ = rⁿ cis(nθ) for positive integers n by induction, using the angle sum identities in the inductive step.
Expanding
Use the binomial theorem and powers of i to write (cos x + i sin x)ⁿ, for n up to 4, as a real part plus an imaginary part.
Proving multi-angle identities
Prove identities for cos(nx), sin(nx) and tan(nx), n up to 4, by equating real and imaginary parts.
Using multi-angle identities
Use multi-angle identities to find exact values, solve equations and rewrite powers of sine and cosine.
Without the chain never starts. The false claim has a valid inductive step, yet it is false for every . Always evaluate both sides at the first value and write " is true".
The assumption is about one value: "assume is true for some ". Writing "assume is true for all " assumes the result. In the inductive step, start from one side of and work to the other; don't manipulate both sides of until they match.
The inductive step must use . If your working never substitutes the assumption, it is not an induction proof. Write "using the assumption" beside the line where you use it.
Replace the index by everywhere in the general term. For the th term is : not , and not .
Write the assumption as for some integer . Writing claims something false: , but .
, not . Similarly , not .
In the term equals . Track each power of : , , .
If a question says "use De Moivre's theorem", a proof with compound angle identities does not answer it. Start from and expand the left-hand side.
To solve , don't divide by . Write and factorise, , so the solutions of stay in.
Set out every induction proof in the four parts the syllabus names (initial statement, assumption statement, inductive step and conclusion) so a marker can find each mark.
Define and its domain first, e.g. "Let be the statement for ."
Before the inductive step, write down the target: with substituted and the right-hand side simplified. Then work from the left-hand side to that target.
Show and label the line where the assumption is used. In a divisibility proof, say that and explain why the final bracket is an integer.
End with the conclusion sentence: " is true, and true implies true, so by the principle of mathematical induction is true for all ."
Check your algebra by substituting into your expression for the sum to terms: it should equal the sum of the first two terms.
In De Moivre proofs, name each identity you use (angle sum, Pythagorean) and write "equating real parts" and "equating imaginary parts" explicitly.
Proofs in this topic are Paper 1 (technology-free) material. In Paper 2 a CAS can evaluate a sigma sum to check an answer, but a proof must still be written out.
"Hence" means use the result you have just proved. "Hence or otherwise" allows another method, but the proved result is usually the quickest route.
Computer science: programmers prove that loops and recursive algorithms are correct by induction, and count an algorithm's steps with sums such as .
Checking divisibility: is divisible by for every , which is why a whole number is divisible by exactly when the sum of its digits is.
Signal processing and numerical methods: writing as a polynomial in gives the Chebyshev polynomials, which are used to design filters and to approximate functions.
Solving cubic equations: the identity gives the three real roots of cubics such as exactly, a method due to Viète.
Computer graphics and robotics: rotating a point by about the origin is multiplying by , so De Moivre's theorem gives the effect of equal rotations in one step.