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

Question

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

Harshit Singh · Answer

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

Thank you for registering.

Register Now and Win Upto 25% Scholorship for a Full Academic Year !

Enter Your Details

Registration done!

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

1 Answers

Think You Can Provide A Better Answer ?

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

Other Related Questions on Analytical Geometry

ASK QUESTION

Answer and earn gift vouchers

View courses by askIITians

Design classes One-on-One in your own way with Top IITians/Medical Professionals

Complete Self Study Package designed by Industry Leading Experts

Live 1-1 coding classes to unleash the Creator in your Child

a Complete All-in-One Study package Fully Loaded inside a Tablet!

Register Now & Win Upto 25% Scholorship