The inequality n!gt2^(n-1) is true...

The inequality `n!gt2^(n-1)` is true

A

for all `n in N`

B

for all `ngt2`

C

for all `ngt1`

D

for no `n in N`.

Verified by Experts

The correct Answer is:

B

PRINCIPLE OF MATHEMATICAL INDUCTION
OMEGA PUBLICATION|Exercise Multiple Choice Questions|10 Videos
PERMUTATIONS AND COMBINATIONS
OMEGA PUBLICATION|Exercise Multiple Choice Questions (MCQs)|21 Videos
PROBABILITY
OMEGA PUBLICATION|Exercise Multiple Choice Questions (MCQs) |15 Videos

Similar Questions

Explore conceptually related problems

The inequality n ! > 2^(n-1) is true:

Solution set of the inequality ( cot^(-1) x)^(2) - ( 5 cot^(-1) x) + 6 gt 0 is

The locus of the inequality log_(1//3) |z+ 1| gt log_(1//3) |z - 1| is

Mathematical Induction shows that the inequality log (n!) >n/2 holds :

The number of positive integers satisfying the inequality C(n+1,n-2) - C(n+1,n-1)<=100 is

Prove, by Induction, on the inequality (1 +x)^n ge 1 +nx for all natural numbers n, where x > - 1.

The number of positive integers satisfying the inequality ""^(n+1)C_(n-2)-""^(n+1)C_(n-1) le50 is :

If P(n) is the statement ‘‘2^n ge n’’ , prove that P(r +1) is true whenever P(r) is true.

Let P(n) denote the statement that n^2+n is odd . It is seen that P(n)rArr P(n+1),P(n) is true for all

If P(n) is the statement ''2^(3n)-1 is an integral multiple of 7", prove that P(r + 1) is true whenever P(r) is true.