मराठी

Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer - Mathematics

Advertisements
Advertisements

प्रश्न

Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer

बेरीज

उत्तर

P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true.

Let P(n) be 2n < n!

So, the examples of the given statements are,

P(0) ⇒ 20 < 0!

i.e 1 < 1 ⇒ not true.

P(1) ⇒ 21 < 1!

i.e 2 < 1 ⇒ not true.

P(2) ⇒ 22 < 2!

i.e 4 < 2 ⇒ not true.

P(3) ⇒ 23 < 3!

i.e 8 < 6 ⇒ not true.

P(4) ⇒ 24 < 4!

i.e 16 < 24 ⇒ true.

P(5) ⇒ 25 < 5!

i.e 32 < 60 ⇒ true, etc.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 4: Principle of Mathematical Induction - Exercise [पृष्ठ ७०]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics [English] Class 11
पाठ 4 Principle of Mathematical Induction
Exercise | Q 1 | पृष्ठ ७०

व्हिडिओ ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्‍न

Prove the following by using the principle of mathematical induction for all n ∈ N

`1 + 3 + 3^2 + ... + 3^(n – 1) =((3^n -1))/2`


Prove the following by using the principle of mathematical induction for all n ∈ N

`a + ar + ar^2 + ... + ar^(n -1) = (a(r^n - 1))/(r -1)`

Prove the following by using the principle of mathematical induction for all n ∈ N

`(1+ 1/1)(1+ 1/2)(1+ 1/3)...(1+ 1/n) = (n + 1)`


Prove the following by using the principle of mathematical induction for all n ∈ Nn (n + 1) (n + 5) is a multiple of 3.


Prove the following by using the principle of mathematical induction for all n ∈ N (2+7) < (n + 3)2


If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.

 

Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer.


\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]


1.2 + 2.22 + 3.23 + ... + n.2= (n − 1) 2n+1+2

 

2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]

 

12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]

 

n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.

 

\[\frac{n^7}{7} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{n^2}{2} - \frac{37}{210}n\] is a positive integer for all n ∈ N.  

 


\[\text{ Let } P\left( n \right) \text{ be the statement } : 2^n \geq 3n . \text{ If } P\left( r \right) \text{ is true, then show that } P\left( r + 1 \right) \text{ is true . Do you conclude that } P\left( n \right)\text{  is true for all n }  \in N?\]


\[\text{ Using principle of mathematical induction, prove that } \sqrt{n} < \frac{1}{\sqrt{1}} + \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{3}} + . . . + \frac{1}{\sqrt{n}} \text{ for all natural numbers } n \geq 2 .\]

 


Prove by method of induction, for all n ∈ N:

3 + 7 + 11 + ..... + to n terms = n(2n+1)


Prove by method of induction, for all n ∈ N:

1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`


Prove by method of induction, for all n ∈ N:

`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`


Prove by method of induction, for all n ∈ N:

(23n − 1) is divisible by 7


Answer the following:

Prove, by method of induction, for all n ∈ N

2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n 


Answer the following:

Prove by method of induction

`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀  "n" ∈ "N"`


Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.


Prove the statement by using the Principle of Mathematical Induction:

4n – 1 is divisible by 3, for each natural number n.


Prove the statement by using the Principle of Mathematical Induction:

23n – 1 is divisible by 7, for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

n3 – 7n + 3 is divisible by 3, for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.


Prove the statement by using the Principle of Mathematical Induction:

`sqrt(n) < 1/sqrt(1) + 1/sqrt(2) + ... + 1/sqrt(n)`, for all natural numbers n ≥ 2.


Prove the statement by using the Principle of Mathematical Induction:

1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.


State whether the following statement is true or false. Justify.

Let P(n) be a statement and let P(k) ⇒ P(k + 1), for some natural number k, then P(n) is true for all n ∈ N.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×