Resources For Teachers For Tutors For Students & Parents Pricing
Year 12 Maths Extension 2 (2027) Proof

Induction – Series

ACCOUNT REQUIRED

Unlock all 20 questions & worked solutions

You're viewing a free preview. Create an account to access the complete question set, step-by-step solutions, and progress tracking.

All Questions

Access the full question set for every topic.

Worked Solutions

Step-by-step explanations for every answer.

Track Progress

Mark questions right or wrong and monitor your growth.

It's Free

No credit card required - sign up in under a minute.

Question 1
183366
Prove by mathematical induction that, for all positive integers \(n\), \[1 + 2 + 3 + \dots + n = \dfrac{n(n+1)}{2}.\]
Base \(n=1\) holds. Assuming for \(k\), adding \(k+1\) gives \(\dfrac{k(k+1)}{2} + (k+1) = \dfrac{(k+1)(k+2)}{2}\). By induction true for all \(n\).

📚 Want More Questions?

There are 19 more questions available. Create your free account to access the complete question set with detailed solutions.