Thank you for registering.

One of our academic counsellors will contact you within 1 working day.

Please check your email for login details.
MY CART (5)

Use Coupon: CART20 and get 20% off on all online Study Material

ITEM
DETAILS
MRP
DISCOUNT
FINAL PRICE
Total Price: Rs.

There are no items in this cart.
Continue Shopping

Prove that 2n > n for all positive integers n by the Principle of Mathematical Induction

Prove that 2n > n for all positive integers n by the Principle of Mathematical Induction

Grade:12th pass

1 Answers

Harshit Singh
askIITians Faculty 5963 Points
10 months ago
Welcome to askIITians
Assume that P(n): 2n> n

If n =1, 21>1. Hence P(1) is true

Let us assume that P(k) is true for any positive integer k,

It means that, i.e.,

2k> k …(1)

We shall now prove that P(k +1) is true whenever P(k) is true.

Now, multiplying both sides of the equation (1) by 2, we get

2. 2k> 2k

Now by using the property,

i.e., 2k+1> 2k = k + k > k + 1

Hence, P(k + 1) is true when P(k) is true.

Therefore, P(n) is true for every positive integer n is proved using the principle of mathematical induction.

Thanks

Think You Can Provide A Better Answer ?

Provide a better Answer & Earn Cool Goodies See our forum point policy

ASK QUESTION

Get your questions answered by the expert for free