Home
Class 12
MATHS
Let P(n): n^(2)+n is odd. Then P(n) Righ...

Let `P(n): n^(2)+n` is odd. Then `P(n) Rightarrow P(n+1)` for all `n in NN` and `P(1)` is not true. From here, we can conclude that:

A

(a) `P(n)` is true for all `n in NN`

B

(b) `P(n)` is true for all `n ge 2`

C

(c) `P(n)` is false for all `n in NN`

D

(d) `P(n)` is true for all `n ge 3`

Text Solution

Verified by Experts

The correct Answer is:
C
Promotional Banner

Topper's Solved these Questions

  • PRINCIPLE OF MATHEMATICAL

    AAKASH INSTITUTE ENGLISH|Exercise Section-B((Objective Type Questions (One option is correct))|20 Videos

  • PRINCIPLE OF MATHEMATICAL

    AAKASH INSTITUTE ENGLISH|Exercise Section-C(Linked Comprehension Type Questions)|6 Videos

  • PRINCIPLE OF MATHEMATICAL

    AAKASH INSTITUTE ENGLISH|Exercise Try yourself|9 Videos

  • PERMUTATIONS AND COMBINATIONS

    AAKASH INSTITUTE ENGLISH|Exercise Assignment Section-J (Aakash Challengers Questions)|7 Videos

  • PROBABILITY

    AAKASH INSTITUTE ENGLISH|Exercise ASSIGNMENT SECTION-J (aakash challengers questions)|11 Videos

Similar Questions

Explore conceptually related problems

Let P(n) be a statement such that P(n) Rightarrow P(n+1) for all n in NN . Also P(k) is true, k in NN . Then we can conclude that:

Let P(n) be a statement and let P(n) Rightarrow P(n+1) for all natural number n, then P(n) is true.

A student was asked to prove a statement P(n) by using the principle of mathematical induction. He proved that P(n) Rightarrow P(n+1) for all n in N and also that P(4) is true: On the basis of the above he can conclude that P(n) is true.

Consider the statement P(n): n^(2) ge 100 . Here, P(n) Rightarrow P(n+1) for all n . We can conclude that:

A student was asked to prove a statement P(n) by induction. He proved that P(k+1) is true whenever P(k) is true for all k ge 5 in N and also that P(5) is true. On the basis of this he conclude that P(n) is true (i) AA n in W (ii) AA n gt 5 (iii) AA n ge 5 (iv) AA n lt 5

A student was asked to prove a statement by induction. He proved (i) P(5) is true and (ii) truth of P(n) => truth of P(n+1), n in N . On the basis of this, he could conclude that P(n) 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

Let P(n) be the statement "3^n > n" . If P(n) is true, P(n+1) is also true.

If P(n) is the statement n^2+n is even, and if P(r) is true then P(r+1) is true.

Let P(n) be the statement ''(3)^(n)gt n'' . If P(n) is true , prove that P(n + 1) is true.