Specialist Mathematics · Unit 3 · Topic 2

Mathematical induction and trigonometric proofs

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 cos⁡(3x)=4cos⁡3(x)−3cos⁡(x)\cos(3x) = 4\cos^3(x) - 3\cos(x) with De Moivre's theorem.

  • 7 lessons
  • 1 h 57 min of lessons
  • 16 worked examples
  • 10 hours in the syllabus
0 of 7

Start here

The idea of proof by induction

Lesson 1 of 7 · 16 min

Start the topic

Lessons

7
  1. The idea of proof by induction (up next)

    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.

  2. Sigma notation

    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.

  3. Proving sum formulas by induction

    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.

  4. Proving divisibility by induction

    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.

  5. Proving De Moivre's theorem

    Prove De Moivre's theorem for positive integer powers by induction, using i2=−1i^2 = -1 and the angle sum identities in the inductive step.

  6. Multi-angle identities with De Moivre's theorem

    Expand (cos⁡x+isin⁡x)n(\cos x + i \sin x)^n with the binomial theorem and equate its real and imaginary parts with cos⁡(nx)+isin⁡(nx)\cos(nx) + i \sin(nx) to prove identities for angles up to 4x4x.

  7. Using multi-angle identities

    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.

  8. Topic quiz

    Ten questions across the topic, from foundation to complex unfamiliar. Your results feed your mastery.

About this topic

Some statements are about every positive integer at once: a formula for 1+2+⋯+n1 + 2 + \cdots + n, the claim that 7n−17^n - 1 is always a multiple of 66, or De Moivre's theorem for every power nn. 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 cos⁡(3x)=4cos⁡3(x)−3cos⁡(x)\cos(3x) = 4\cos^3(x) - 3\cos(x) in a few lines, and use them to find exact values and solve equations.

Before you start

Builds on Introduction to proof, Complex arithmetic and algebra, Trigonometry and functions and Further complex numbers.

  • Expanding (x+y)n(x + y)^n with the binomial theorem and Pascal's triangle (Mathematical Methods Unit 1).
  • Index laws such as 7k+1=7×7k7^{k+1} = 7 \times 7^k, and factorising algebraic expressions.
  • Proof vocabulary from Unit 1: implication, counterexamples, and the number sets Z\mathbb{Z} and Z+\mathbb{Z}^+.
  • Complex numbers in polar form, z=rcis⁡(θ)z = r\cis(\theta), and multiplying them (Unit 2), and using De Moivre's theorem (Unit 3 Topic 1).
  • The Pythagorean, angle sum and double angle identities (Unit 2).

What QCAA says you need to know6 dot points

Mathematical induction

8 hours

Trigonometric proofs using De Moivre's theorem

2 hours
  • Prove multi-angle trigonometric identities up to angles of 4x4x by equating parts using the binomial expansion and De Moivre's theorem, e.g. cos⁡(3x)=4cos⁡3(x)−3cos⁡(x)\cos(3x) = 4\cos^3(x) - 3\cos(x) and sin⁡(3x)=3sin⁡(x)−4sin⁡3(x)\sin(3x) = 3\sin(x) - 4\sin^3(x).LessonsMulti-angle identities with De Moivre's theoremUsing multi-angle identities

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.

    Practise
  • Sigma notation

    Expand, evaluate and write sums in sigma notation, count their terms and split off the last term.

    Practise
  • Proving sum formulas by induction

    Prove a formula for a sum for every positive integer n by mathematical induction.

    Practise
  • Proving divisibility by induction

    Prove that an expression is divisible by a given integer for every positive integer n by mathematical induction.

    Practise
  • 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.

    Practise
  • Expanding (cos⁡x+isin⁡x)n(\cos x + i \sin x)^n

    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.

    Practise
  • Proving multi-angle identities

    Prove identities for cos(nx), sin(nx) and tan(nx), n up to 4, by equating real and imaginary parts.

    Practise
  • Using multi-angle identities

    Use multi-angle identities to find exact values, solve equations and rewrite powers of sine and cosine.

    Practise

Worked examples16

All 16

Common mistakes

Skipping the initial statement

Without P(1)P(1) the chain never starts. The false claim 2+4+⋯+2n=n2+n+12 + 4 + \cdots + 2n = n^2 + n + 1 has a valid inductive step, yet it is false for every nn. Always evaluate both sides at the first value and write "P(1)P(1) is true".

Assuming what you are proving

The assumption is about one value: "assume P(k)P(k) is true for some k∈Z+k \in \mathbb{Z}^+". Writing "assume P(n)P(n) is true for all nn" assumes the result. In the inductive step, start from one side of P(k+1)P(k+1) and work to the other; don't manipulate both sides of P(k+1)P(k+1) until they match.

Not using the assumption

The inductive step must use P(k)P(k). If your working never substitutes the assumption, it is not an induction proof. Write "using the assumption" beside the line where you use it.

The wrong (k + 1)th term

Replace the index by k+1k + 1 everywhere in the general term. For ∑r(2r−1)\sum r(2r - 1) the (k+1)(k+1)th term is (k+1)(2k+1)(k+1)(2k+1): not k(2k−1)k(2k - 1), and not (k+1)(2k−1)(k+1)(2k - 1).

Using k as the multiplier in a divisibility proof

Write the assumption as 7k−1=6M7^k - 1 = 6M for some integer MM. Writing 7k−1=6k7^k - 1 = 6k claims something false: 72−1=487^2 - 1 = 48, but 6×2=126 \times 2 = 12.

Index law slips

7k+1=7×7k7^{k+1} = 7 \times 7^k, not 7k+77^k + 7. Similarly 32(k+1)=9×32k3^{2(k+1)} = 9 \times 3^{2k}, not 32k+23^{2k} + 2.

Forgetting that i2=−1i^2 = -1

In (cos⁡x+isin⁡x)3(\cos x + i\sin x)^3 the term 3cos⁡x (isin⁡x)23\cos x\,(i\sin x)^2 equals −3cos⁡xsin⁡2x-3\cos x\sin^2 x. Track each power of ii: i2=−1i^2 = -1, i3=−ii^3 = -i, i4=1i^4 = 1.

Not using the method asked for

If a question says "use De Moivre's theorem", a proof with compound angle identities does not answer it. Start from (cos⁡x+isin⁡x)n=cos⁡(nx)+isin⁡(nx)(\cos x + i\sin x)^n = \cos(nx) + i\sin(nx) and expand the left-hand side.

Losing solutions by dividing

To solve sin⁡(3x)=sin⁡x\sin(3x) = \sin x, don't divide by sin⁡x\sin x. Write 3sin⁡x−4sin⁡3x−sin⁡x=03\sin x - 4\sin^3 x - \sin x = 0 and factorise, 2sin⁡x(1−2sin⁡2x)=02\sin x(1 - 2\sin^2 x) = 0, so the solutions of sin⁡x=0\sin x = 0 stay in.

Exam tips

  1. 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.

  2. Define P(n)P(n) and its domain first, e.g. "Let P(n)P(n) be the statement …\ldots for n∈Z+n \in \mathbb{Z}^+."

  3. Before the inductive step, write down the target: P(k+1)P(k+1) with k+1k + 1 substituted and the right-hand side simplified. Then work from the left-hand side to that target.

  4. Show and label the line where the assumption is used. In a divisibility proof, say that M∈ZM \in \mathbb{Z} and explain why the final bracket is an integer.

  5. End with the conclusion sentence: "P(1)P(1) is true, and P(k)P(k) true implies P(k+1)P(k+1) true, so by the principle of mathematical induction P(n)P(n) is true for all n∈Z+n \in \mathbb{Z}^+."

  6. Check your algebra by substituting k=1k = 1 into your expression for the sum to k+1k + 1 terms: it should equal the sum of the first two terms.

  7. In De Moivre proofs, name each identity you use (angle sum, Pythagorean) and write "equating real parts" and "equating imaginary parts" explicitly.

  8. 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.

  9. "Hence" means use the result you have just proved. "Hence or otherwise" allows another method, but the proved result is usually the quickest route.

Where this shows up

  • Computer science: programmers prove that loops and recursive algorithms are correct by induction, and count an algorithm's steps with sums such as 1+2+⋯+n=n(n+1)21 + 2 + \cdots + n = \frac{n(n+1)}{2}.

  • Checking divisibility: 10n−110^n - 1 is divisible by 99 for every nn, which is why a whole number is divisible by 99 exactly when the sum of its digits is.

  • Signal processing and numerical methods: writing cos⁡(nx)\cos(nx) as a polynomial in cos⁡x\cos x gives the Chebyshev polynomials, which are used to design filters and to approximate functions.

  • Solving cubic equations: the identity cos⁡(3θ)=4cos⁡3θ−3cos⁡θ\cos(3\theta) = 4\cos^3\theta - 3\cos\theta gives the three real roots of cubics such as 8x3−6x−1=08x^3 - 6x - 1 = 0 exactly, a method due to Viète.

  • Computer graphics and robotics: rotating a point by θ\theta about the origin is multiplying by cis⁡θ\cis\theta, so De Moivre's theorem gives the effect of nn equal rotations in one step.

Save your progress with a free account