Let P(n): 3n+1 > 3(n + 1)
Step 1: Put n = 1
Then, 32 > 3(2)
⇒ p(n) is true for n = 1
Step 2: Assume that p(n) is true for n = k then, 3k+1 > 3(k + 1)
Multiplying throughout with '3'.
3k+1×3>3(k+1)×3=9k+9=3(k+2)+(6k+3)>3(k+2)
⇒3¯¯¯¯¯¯¯¯¯¯¯k+1+1>3(¯¯¯¯¯¯¯¯¯¯¯¯¯¯k+1+1)
P(n) is true for n = k + 1
∴ By the principle of mathematical induction,
P(n) is true for all n ϵ N.
Hence, 3n+1 > 3(n + 1) ∀ n ϵ N.