Show by using the principle of mathemati...

Show by using the principle of mathematical induction that for all natural number `n gt 2, 2^(n) gt 2n+1`

A

for `n ge 3`

B

for `nlt 3`

C

for all n

D

for mn

Verified by Experts

Check through options , the condition `2^ngt 2n +1` is valid for `nge3`.

Similar Questions

Explore conceptually related problems

Prove the following by using the principle of mathematical induction for all n in N 3^n gt 2^n

Prove each of the statements by the principle of mathematical induction : n^2 lt 2^n , for all natural numbers n gt= 5

Prove the following by using the principle of mathematical induction for all n in N (2n+1) lt 2^n , n >= 3

Prove the following by using the principle of mathematical induction for all n in N 1 + 2 + 2^2 + …..+2^n = 2^(n+1) -1

Prove the following by using the principle of mathematical induction for all n in N 4+8 + 12 + …….+4n = 2n (n+1)

Prove the statement by the principle of mathematical induction : For any natural numbers n, 7^n - 2^n is divisible by 5.

Prove each of the statements by the principle of mathematical induction : 2n lt (n + 2) ! for all natural number n .

Prove the following by using the principle of mathematical induction for all n in N (2n+7) lt (n+3)^2

Prove the following by using the principle of mathematical induction for all n in N 1+2+3+…….+n lt 1/8 (2n+1)^2

Prove the following by using the principle of mathematical induction for all n in N 1+3+3^2 +…………+3^(n-1) = (3^n -1)/(2)