BRAINBIT
CoursesExamsUse casesPricingAbout
Get started
CoursesExamsUse casesPricingAbout
CoursesMathematicsThe Principle of Mathematical Induction

Chapter 14: Mathematical Induction

The Principle of Mathematical Induction

Prove sum, divisibility and inequality results for all natural numbers with a base case and an inductive step.

JEE MainJEE Advanced

Explanation

Welcome to The Domino Hall

How can you prove something for every natural number without checking them all? Line them up like dominoes.

Push the first one, show that each one knocks over the next, and they all fall. That's mathematical induction.

Dominoes

Picture a line of dominoes that never ends. If the first one falls, and every falling domino knocks over the next, then every domino falls.

Induction proves statements the same way.

Dominoes: the first falls · each one knocks the next → all fall

Step 1

Three steps. First, check the statement for n equals one.

Second, assume it's true for some k: that's the induction hypothesis. Third, use that assumption to prove it for k plus one.

Step 1: check P(1) · Step 2: assume P(k) · Step 3: prove P(k + 1) using P(k)

Sums

For a sum, start from the formula for k and add the next term to both sides. Factor, and the formula for k plus one should appear.

Sums: 1 + 2 + … + k = k(k + 1)/2 → add (k + 1) → (k + 1)(k + 2)/2

Divisibility

For divisibility, rewrite the k plus one case so the k case shows up inside it. Five to the k plus one minus one is five times five to the k minus one, plus four.

Both parts are divisible by four.

Divisibility: 5ᵏ⁺¹ − 1 = 5(5ᵏ − 1) + 4

Inequalities may start later

Sometimes the first domino isn't at one. Two to the n beats n squared only from n equals five onwards.

Your base case then starts at five.

Inequalities may start later: 2ⁿ > n² is false for n = 2, 3, 4 and true from n = 5

Worked example

Show 4 divides 7ⁿ − 3ⁿ. P(1): 7 − 3 = 4.

Assume 4 divides 7ᵏ − 3ᵏ. Then 7ᵏ⁺¹ − 3ᵏ⁺¹ = 7(7ᵏ − 3ᵏ) + 4 × 3ᵏ, and both parts are multiples of 4.

Memory tricks

  • Knock the first domino, then show each one knocks the next.Pehla domino girao, phir dikhao har ek agla girata hai.
  • Check the base, assume for k, then prove the next and walk away.Base check karo, k maano, k plus one saabit karo.
  • A few examples that work are never a proof.Kuch examples sahi hon toh bhi proof nahi banta.

Try 3 practice questions

  1. Q1. n(n + 1)(2n + 1) is always divisible by

    1. A. 6
    2. B. 4
    3. C. 5
    4. D. 12
    Show answer

    Answer: 6

    It equals 6 times the whole number 1² + 2² + … + n²

  2. Q2. 3²ⁿ − 1 is always divisible by

    1. A. 8
    2. B. 5
    3. C. 7
    4. D. 16
    Show answer

    Answer: 8

    3²ⁿ − 1 = 9ⁿ − 1, and 9 leaves remainder 1 on division by 8

  3. Q3. Proving 1 + 3 + … + (2n − 1) = n², the step from k to k + 1 adds

    1. A. 2k + 1
    2. B. 2k − 1
    3. C. k + 1
    4. D. 2k
    Show answer

    Answer: 2k + 1

    The (k + 1)th odd number is 2(k + 1) − 1 = 2k + 1, and k² + 2k + 1 = (k + 1)²

Learn The Principle of Mathematical Induction the fun way

Voice-explained cards, mini-games, full practice and the exam round. Free with one account.

Start Mathematics
PreviousAngles of Elevation & DepressionNextConstraints, Feasible Region & Corner Points
BRAINBIT

Bite-sized, game-like lessons for JEE, NEET, Banking and SSC aspirants.

Courses

  • Inorganic Chemistry
  • Organic Chemistry
  • Physical Chemistry
  • Physics
  • Mathematics
  • Biology
  • Logical Reasoning
  • Quantitative Aptitude
  • Data Interpretation
  • English Language
  • General Awareness
  • Typing
  • Vedic Math
  • Abacus
  • Logical Puzzles

Exams

  • JEE Main
  • JEE Advanced
  • NEET
  • IBPS PO
  • SBI PO
  • SSC CGL
  • CAT
  • RRB NTPC

Brainbit

  • Courses
  • Exams
  • Use cases
  • Pricing
  • About

© 2026 Brainbit. All rights reserved.

Privacy PolicyTerms & Conditions
Sign in
Get started
Start Mathematics