Assume given statement
Let P(n):4n−1 is divisible by 3 for each natural number n.
Check that statement is true forn=1
P(1)=41−1=3
∴P(1) is divisible by 3.
So, P(1)is true.
Assume P(k) to be true and then prove P(k+1) is true.
Assume that P(n) is true for somen=kϵN.
∴P(k):4k−1 is divisible by 3 is true.
i.e.,4k−1=3q, where qϵN
⇒4k=3q+1…(1)
Now we have to prove for P(k+1)
P(k+1):4k+1−1=4.4k−1
=4(3q+1)−1 (From (1))
=12q+4−1=3(4q+1),
where qϵN⇒P(k+1) is divisible by 3
Thus P(k+1)is true, whenever P(k) is true.
Hence, By Principle of mathematical Induction, P(n) is true for all natural numbers n.