Basic Mathematical Induction Inequality Step 1 Show it is true for n 3 n 3. . 2nn2 2 n.
Then the set S of positive integers for which Pn is false is nonempty.
Abstract description of induction The simplest application of proof by induction is to prove that a statement Pn is true for all n 1. To prove it re-arrange this expression to include 32k 1. N n n 1 2 for all positive integers n. 1234n 2 n4 n is an in.