✨ The Magic of Mathematical Induction ✨

Unlock the spell that proves infinite truths with just two simple steps!

The Wizard's Secret

Mathematical induction is like a magic spell that lets you prove statements for all natural numbers with just two incantations:

The Induction Spellbook

  1. Base Charm (n=1): Prove the statement works for the first number
  2. Inductive Hex: Show that if it's true for any number k, it must be true for k+1

Master these two spells, and you can prove infinite truths with finite effort!

Watch as the dominoes fall - when you knock over the first one (base case) and ensure each knocks over the next (inductive step), all dominoes must fall!

Casting the Spell

1

Base Charm

Prove your statement works for the starting number (usually n=1). This is your foundation.

Example Spell: Show 1 = 1(1+1)/2 for sum of first n numbers.

2

Inductive Hex

Assume true for k (magic hypothesis), then prove for k+1. This creates the domino effect!

Example Hex: If 1+...+k = k(k+1)/2, then 1+...+k+(k+1) = (k+1)(k+2)/2.

Why This Magic Works

The base charm gives you P(1). The inductive hex with k=1 gives P(2). Then P(3), P(4), and so on to infinity!

It's like an enchanted ladder - if you can step on the first rung (base case) and each rung automatically creates the next (inductive step), you can climb to any height!

Spellbook Examples

Sum of First n Numbers

Prove: 1 + 2 + 3 + ... + n = n(n+1)/2 for all n ≥ 1
Base Charm (n=1):
Left side = 1
Right side = 1(1+1)/2 = 1
Both sides equal - the charm works!
Inductive Hex:
Assume true for n=k: 1 + 2 + ... + k = k(k+1)/2

Now prove for n=k+1:
1 + 2 + ... + k + (k+1) = [k(k+1)/2] + (k+1) = (k+1)(k/2 + 1) = (k+1)(k+2)/2
The hex transforms k into k+1 perfectly!
Conclusion: By mathematical magic (induction), the formula holds ∀n ≥ 1.

Sum of Odd Numbers

Prove: 1 + 3 + 5 + ... + (2n-1) = n² for all n ≥ 1
Base Charm (n=1):
Left side = 1
Right side = 1² = 1
The charm holds!
Inductive Hex:
Assume true for n=k: 1 + 3 + ... + (2k-1) = k²

Now prove for n=k+1:
1 + 3 + ... + (2k-1) + (2(k+1)-1) = k² + (2k+1) = (k+1)²
The magical transformation is complete!
Conclusion: The spell holds for all natural numbers.

Your Magic Practice

Wizard's Proof Builder

):
Your magical proof will appear here...

Wizard's Wisdom

Magical Tips

  • ✨ Always clearly state what you're proving (P(n))
  • ✨ Label your base charm and inductive hex clearly
  • ✨ In the hex, explicitly state your magical assumption
  • ✨ Show the magical transformation from P(k) to P(k+1)

Common Curses (Mistakes)

  • 💀 Forgetting the base charm: No first domino = no magic!
  • 💀 Assuming P(k+1): You must prove it using P(k), not assume it
  • 💀 Weak magic connection: Failing to show how P(k) leads to P(k+1)
  • 💀 Wrong magic variable: Make sure you're casting the spell on n