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

By PMC, prove that inequality n<2n for all nN

Open in App
Solution

Step 1: prove for n=1
1<2

Step 2:

n+1<2(2n)
n<2(2n)1
n<2n+2n1
The function 2n+2n1 is surely higher than 2n1 so if n<2n is true (induction step), n<2n+2n1 has to be true as well.

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