Review of mathematical induction (HSC SSCE Mathematics Extension 2): Flashcards

A method to prove statements for all natural numbers.

The first proof step for the smallest number, n=0 or n=1.

Show if true for n=k, then true for n=k+1.

Assuming the statement is true for n=k.

Knocking the first domino proves the rest fall too.

1 + 2 + ... + n = n(n+1)/2 for n ≥ 1.

It's the initial step proving the statement true for n=1.

A short way to write series and sequences.

Errors in base case, inductive step, or hypothesis.

Proving divisibility and verifying binomial expansions.