Use induction to prove the identity for every positive integer n.
Official paper · jm02-2021 · 4(c)(i) · PDF 6
Official original and suggested answers ↗ · Suggested answer PDF page 11
Skills and prerequisite lessons
Working and explanation
BUILD THE REASONING
Hint 1
Hint 2
Worked solution
The base case holds for every real x.
Assume the statement for a fixed positive integer k.
The addition formulas give a telescoping increment.
Add the new term to the induction hypothesis; the old right side cancels.
The base and implication establish the identity for all positive integers n.
The identity holds for all n≥1 and every real x.
Checks and common pitfalls: No division by sin x is needed in the induction proof.
Reasoning checklist · self / teacher assessment
- Teaching assessment checklist, independently authored. Use the original paper for official marks.
- The base case holds for every real x.
- Assume the statement for a fixed positive integer k.
- The addition formulas give a telescoping increment.
- Add the new term to the induction hypothesis; the old right side cancels.
- The base and implication establish the identity for all positive integers n.
Think first. Reveal a hint when the class is ready.