In strong induction, the inductive hypothesis assumes P(n0), P(n0+1), ..., P(k) are ALL true (not just P(k)), then proves P(k+1). This is useful when P(k+1) depends on multiple previous cases, not just the immediately preceding one. Example: proving every integer >= 2 has a prime factorization.