This preview shows page 1. Sign up to view the full content.
Unformatted text preview: such that P (1) is true, and whenever k is such that P ( k ) is true, then P ( k + 1) is true, Then P ( n ) is true for all n N . [It is often helpful to specify exactly what family of statements P ( n ) you are proving by induction.] You may assume I am familiar with the logic of proof by contradiction. If you write a proof by contradiction, make sure to say this somewhere in particular, specify where exactly the contradiction comes from....
View Full Document
- Fall '07