*This preview shows
page 1. Sign up
to
view the full content.*

**Unformatted text preview: **[ P ( n + 1) is true ] then P ( n ) is true for each n Z such that n n . 2.5: PMI (strong form) (our book calls this PCI = Principle of Complete Induction) Fix n Z . If base step: P ( n ) is true inductive step: for each n Z with n n : [ P ( j ) is true for j = n , 1 + n ,...,n ] = [ P ( n + 1) is true ] then P ( n ) is true for each n Z such that n n . 1...

View
Full
Document