Strong Induction

Book: A Walk through Combinatorics

  1. Initial step: prove that statement is true for smallest value of nn
  2. Induction step: Prove that from the fact that the statement is true for all integers less than n+1n + 1 (the induction hypothesis), it follows that the statement is also true for n+1n + 1.