Use mathematical induction to prove that...

Use mathematical induction to prove that `2 n - 3 le 2^(n-2) ` for all `n ge 5, n in N`

Verified by Experts

The correct Answer is:

`n = k + 1, k ge 5`

MATHEMATICAL INDUCTION
VIKRAM PUBLICATION ( ANDHRA PUBLICATION)|Exercise Exercise 2 (a)|15 Videos
MARCH - 2016 (TELANGANA)
VIKRAM PUBLICATION ( ANDHRA PUBLICATION)|Exercise Section -C (Long answer type quesitons)|7 Videos
MATRICES
VIKRAM PUBLICATION ( ANDHRA PUBLICATION)|Exercise SOLVED PROBLEMS |45 Videos

Similar Questions

Explore conceptually related problems

Use Mathematical induction to prove that (1 + x)^(n) gt 1 + nx for n ge 2, x gt - 1, x ne 0

Use mathematical induction to prove that statement 1^(3) + 2^(3) + 3^(3) + . . . + n^(3) = (n^(2) (n + 1)^(2))/( 4) , AA n in N

Use mathematical induction to prove that statement sum_(k = 1)^(n) (2 K - 1)^(2) = (n (2 n - 1) (2n + 1))/( 3) for all n in N

Use mathematical induction, to find 41^(n) - 14^(n) is a multiple of

Using the principle of Mathematical Induction, Show that 49^n+16n-1 is divisible by 64, forall n in N .

Using Mathematical Induction, prove that statement for all n in N 1.2.3+2,3,4+……….+("upto n terms")=(n(n+1)(n+2)(n+3))/(4) .

Using Mathematical Induction, prove that statement for all n in N (1+3/1)(1+5/4)(1+7/9)........(1+(2n+1)/n^2)=(n+1)^2 .

By mathematical induction, show that 49^n+16n-1 is divisible by 64 for all positive integer n.

Using the principle of Mathematical Induction, show that 2.4^(2n+1)+3^(3n+1) is divisible by 11, forall n in N