Let P(n) : n2 < 2n for all natural numbers, n ≥ 5
Step 1 :
P(5) : 15 < 25 ⇒ 1 < 32 which is true for P(5)
Step 2 :
P(k): k2 < 2k. Let it be true for k ∈ N
Step 3 :
P(k + 1): (k + 1)2 < 2k + 1
From Step 2, we get k2 < 2k
⇒ k2 < 2k + 1 < 2k + 2k + 1
From eqn. (i) and (ii), we get (k + 1)2 < 2k + 1
Hence, P(k + 1) is true whenever P(k) is true for k ∈ N, n ≥ 5.