CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Prove by the Principle of Mathematical Induction: 4n1 is divisible by 3, for each natural number n.

Open in App
Solution

Assume given statement

Let P(n):4n1 is divisible by 3 for each natural number n.

Check that statement is true forn=1

P(1)=411=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):4k1 is divisible by 3 is true.

i.e.,4k1=3q, where qϵN

4k=3q+1(1)

Now we have to prove for P(k+1)

P(k+1):4k+11=4.4k1

=4(3q+1)1 (From (1))

=12q+41=3(4q+1),

where qϵNP(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.

flag
Suggest Corrections
thumbs-up
2
Join BYJU'S Learning Program
Join BYJU'S Learning Program
CrossIcon