A student was asked to prove a statement P (n) by method of induction. He proved that P (3 ) is true such that P (n) = P (n + 1 ) for all
n ∈ N
n ≥ 3
n ∈ I
n < 3
The value of ( 1 x 2 x 3 ) + ( 2 x 3 x 4 ) + ( 3 x 4 x 5 ) + ..... + n terms is
If x > y > 0 where a > 1, then ?
log ax > log ay
logax < logay
logax ≥ logay
log ax = log ay
If a and b are natural numbers such that a2 - b2 is a prime number, then
a2 - b2 = 1
a2 - b2 = 2
a2 - b2 = a - b
a2 - b2 = a + b
If Pm stands for mPm' then the value of 1 + P1 + 2P2 + 3P3 + ..... + nPn is
n!
n2
( n + 1 )!
( n - 1 ) !
The statement P (n ): ( 1 x 1! ) + (2 x 2! ) + (3 x 3! ) + .... + ( n x n !) = ( n + 1 )! - 1' is
True for all values of n > 1
Not true for any value of n
True for all values of n ∈ N
None of these
If x 3 > ( x2 + x + 2 ), then
x < 2
x ≥ 2
x > 2
x ≤ 2
P (n) = P (n + 1 ) for all natural numbers n, then P (n) is true ?
For all n
For all n > 1
For all n > m
Nothing can be said
The unit digit in the number 7126 is
1
3
9
5
The remainder, when number 599 is divided by 13, is
2
8
12
32
