wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Using the principle of Mathematical Induction, prove the following for all n and N
1) 3n>2n

Open in App
Solution

Let P(n):3n>2n
Step (i) for n=1
P(1):3>2
which is true for n=1
Step (ii)
Let it is true for n=k
So, 3k>2k
Step (iii)
We have to prove that it is true for n=k+1 using step (ii)
Now 3k+1=3k×3
3k+1>2k×3 using step (ii)
3k+1>2k(2+1)
3k+1>2k+1+2k
Therefore, 3k+1>2k+1
So it is true for n=k+1
therefore, it is true for all nN
Hence proved.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Mathematical Induction
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon