TalentJR apps
Textbook: Mathematics II – Class 11 (Balbharati, official free PDF) · pages 69–74
How can you prove that a formula holds for every natural number when you cannot check infinitely many cases? Mathematical induction works like a row of dominoes: show the first one falls, and show that whenever one falls the next one also falls. Then they all fall. This exercise uses induction to prove sum formulas, divisibility results, a recurrence, De Moivre's theorem and a matrix power.
Step I (base): prove P(1) is true.
Step II (assumption): assume P(k) is true for some natural number k.
Step III (inductive step): using P(k), prove P(k + 1).
Step IV (conclusion): by the principle of mathematical induction, P(n) is true for all n ∈ N.
Both the base case and the inductive step are essential; a statement can pass one and fail the other.
Get a ✓ Verified tutor for “Exercise 4.1 – Principle of mathematical induction” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Prove 1 + 3 + 5 + … + (2n − 1) = n² for all n ∈ N.
Answer: Proved
Prove 1 + 2 + 4 + … + 2ⁿ⁻¹ = 2ⁿ − 1.
Answer: Proved
Prove 6ⁿ − 1 is divisible by 5.
Answer: Proved
If A = [[1, 1], [0, 1]], prove Aⁿ = [[1, n], [0, 1]].
Answer: Proved
| What | Formula | Symbols |
|---|---|---|
| Induction steps | P(1) true; P(k) ⇒ P(k + 1) | then P(n) for all n ∈ N |
| Sum step | Sₖ₊₁ = Sₖ + tₖ₊₁ | add the next term |
| Divisibility step | write fᵏ = d·m and substitute | 6ᵏ − 1 = 5m |
| Σr² | n(n + 1)(2n + 1)/6 | proved by induction (Q3) |
| Telescoping check | 1/[(2r − 1)(2r + 1)] sums to n/(2n + 1) | Q8 |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1 and Q2. Prove (1) 2 + 4 + 6 + … + 2n = n(n + 1) (2) 3 + 7 + 11 + … to n terms = n(2n + 1).
Answer: Both proved.
2. Q3 and Q4. Prove (3) 1² + 2² + … + n² = n(n + 1)(2n + 1)/6 (4) 1² + 3² + 5² + … + (2n − 1)² = n(2n − 1)(2n + 1)/3.
Answer: Both proved.
3. Q5 and Q6. Prove (5) 1³ + 3³ + 5³ + … to n terms = n²(2n² − 1) (6) 1·2 + 2·3 + … + n(n + 1) = n(n + 1)(n + 2)/3.
Answer: Both proved.
4. Q7 to Q9. Prove (7) 1·3 + 3·5 + 5·7 + … to n terms = n(4n² + 6n − 1)/3 (8) Σ 1/[(2r − 1)(2r + 1)] = n/(2n + 1) (9) 1/(3·5) + 1/(5·7) + … to n terms = n/[3(2n + 3)].
Answer: All three proved.
5. Q10 and Q11. Prove (10) 2³ⁿ − 1 is divisible by 7 (11) 2⁴ⁿ − 1 is divisible by 15.
Answer: Both proved.
6. Q12 and Q13. Prove (12) 3ⁿ − 2n − 1 is divisible by 4 (13) 5 + 5² + … + 5ⁿ = (5/4)(5ⁿ − 1).
Answer: Both proved.
7. Q14. Prove (cos θ + i sin θ)ⁿ = cos nθ + i sin nθ for all n ∈ N.
Answer: Proved (De Moivre's theorem for natural n).
8. Q15 and Q16. (15) Given tₙ₊₁ = 5tₙ + 4 and t₁ = 4, prove tₙ = 5ⁿ − 1. (16) Prove [[1, 2], [0, 1]]ⁿ = [[1, 2n], [0, 1]].
Answer: Both proved.
Read the question, answer it in your head, then tap the card to check. 20 cards.
15 questions. Tap an option — you will see at once if it is right and why.
1. The first step of mathematical induction is to
Answer: C. The base case.
2. In the inductive step we prove
Answer: D. The domino link.
3. 2 + 4 + 6 + … + 2n equals
Answer: C. 2 × n(n + 1)/2.
4. 3 + 7 + 11 + … to n terms equals
Answer: D. A.P. with a = 3, d = 4.
5. 1³ + 3³ + 5³ + … to n terms equals
Answer: C. Check n = 2: 28 = 4 × 7.
6. 1·2 + 2·3 + … + n(n + 1) equals
Answer: B. Check n = 1: 2.
7. 1/(1·3) + 1/(3·5) + … + 1/[(2n − 1)(2n + 1)] equals
Answer: A. Telescoping halves.
8. 2³ⁿ − 1 is always divisible by
Answer: A. 8ⁿ − 1 with 8 ≡ 1 (mod 7).
9. 2⁴ⁿ − 1 is always divisible by
Answer: D. 16ⁿ − 1.
10. 3ⁿ − 2n − 1 is divisible by
Answer: D. Values 0, 4, 20, 72, …
11. 5 + 5² + … + 5ⁿ equals
Answer: D. G.P. with a = 5, r = 5.
12. If t₁ = 4 and tₙ₊₁ = 5tₙ + 4, then t₃ is
Answer: B. 4 → 24 → 124 = 5³ − 1.
13. [[1, 2], [0, 1]]³ equals
Answer: D. [[1, 2n], [0, 1]] with n = 3.
14. A statement P(n) satisfies P(k) ⇒ P(k + 1) but P(1) is false. Then
Answer: B. The base case is essential.
15. In proving 1² + … + n² by induction, the (k + 1)th term added is
Answer: B. The next square.
Get a ✓ Verified tutor for “Exercise 4.1 – Principle of mathematical induction” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Exercise 4.1 – Principle of mathematical induction the fun way: match key terms, beat the 60-second lightning round and spot true or false facts. Every game uses only this lesson, so each round is real exam revision.
⭐ 0 XP⏱ About 50 minutes
Get a ✓ Verified tutor for “Exercise 4.1 – Principle of mathematical induction” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Sign in free to see the answers to the textbook exercise of Exercise 4.1 – Principle of mathematical induction.
Sign in to see solutionsStuck on a question? Type it, 🎤 speak it or 📷 snap a photo of it and get simple, step-by-step help with “Methods of Induction and Binomial Theorem Exercise 4.1” — important questions, a quick quiz, revision notes — in English, मराठी or हिंदी.
Sign in with Google to ask the AI tutor. It's free — 20 questions a day, one TalentJR account.
Sign in to askPrefer a real teacher? TalentJR teachers take live online classes anywhere in India. Tell us what you need and our team will call you with timings and fees.