Simple Example On Mathematical Induction

 

Think of Mathematical Induction as the ultimate way to knock over an infinite line of dominoes.

Instead of walking down the line and pushing every single domino over one by one (which would take forever), you only need to prove two things:

1. The First Domino Falls: You can actually push the very first domino over.
2. The Chain Reaction Works: If any given domino falls, it is guaranteed to knock over the next one.

If you prove both, you've proven that the entire infinite line of dominoes will fall.

The Example: The Odd Number Ladder

Let's say someone tells you a trick: "If you add up consecutive odd numbers starting from 1, the answer is always a perfect square."

Let's test it out to see if they are right:

• Add the first 1 odd number: 1 = 1²
• Add the first 2 odd numbers: 1 + 3 = 4 = 2²
• Add the first 3 odd numbers: 1 + 3 + 5 = 9 = 3²
• Add the first 4 odd numbers: 1 + 3 + 5 + 7 = 16 = 4²

It seems to work perfectly! The rule or formula for this pattern is:

1 + 3 + 5 + ... + (2n - 1) = n²

But how do we prove this works for the first 100 odd numbers? Or the first million? Or forever? This is where mathematical induction saves the day in three simple steps.

Step 1: The Base Case (The First Domino)

First, we must prove the formula works for the very first number, where n = 1.

• Left side (just the first number): 1
• Right side (using the formula n² where n=1): 1² = 1

Both sides match! The first domino falls.

Step 2: The Inductive Hypothesis (The "What If?")

Now, we assume the trick works for some random step in the middle of the line. Let's call this step k.

We just assume this mathematical statement is completely true:

1 + 3 + 5 + ... + (2k - 1) = k²

This is our setup. We are looking at the line of dominoes and saying, "Let's imagine domino k just fell."

Step 3: The Inductive Step (The Chain Reaction)

Now we have to prove that because domino k fell, the next domino, domino k + 1, must also fall.

If we write out the sum for k + 1 terms, it looks like this:

1 + 3 + 5 + ... + (2k - 1) + [2(k+1) - 1]

Look closely at that long string of numbers. Notice that the front part of it is exactly our Step 2 setup! Because we assumed that front part equals k², we can swap it out:

= k² + [2(k+1) - 1]

Now, let's simplify the stuff inside the brackets:

= k² + [2k + 2 - 1]

= k² + 2k + 1

If you remember basic high school algebra, k² + 2k + 1 can be factored perfectly into a square:

= (k + 1)²

The Grand Conclusion

Look at what we just accomplished! By assuming the formula worked for k, we did a little algebra and showed that the next step automatically simplified to (k + 1)².

• Because we proved it works for 1 (Step 1), it automatically triggers it to work for 2.
• Because it works for 2, it automatically triggers it to work for 3.
• Because it works for 3, it triggers 4... and so on, all the way to infinity.

You've just knocked down every single domino in existence using math induction!