हिंदी

Let P(N) Be the Statement : 2n ≥ 3n. If P(R) is True, Show that P(R + 1) is True. Do You Conclude that P(N) is True for All N ∈ N?

Advertisements
Advertisements

प्रश्न

Let P(n) be the statement : 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all n ∈ N

Advertisements

उत्तर

\[P\left( n \right): 2^n \geq 3n\]
\[\text{ We know that } P\left( r \right) \text{ is true }  . \]
\[\text { Thus, we have: }  \]
\[ 2^r \geq 3r\]
\[\text{ To show: P(r + 1) is true }  . \]
\[\text{ We know: } \]
\[P(r) \text{ is true } . \]
\[ \therefore 2^r \geq 3r\]
\[ \Rightarrow 2^r . 2 \geq 3r . 2 \left[ \text{ Multiplying both sides by } 2 \right]\]
\[ \Rightarrow 2^{r + 1} \geq 6r\]
\[ \Rightarrow 2^{r + 1} \geq 3r + 3r\]
\[ = 2^{r + 1} \geq 3r + 3 \left[ \text{ Since } 3r \geq 3 \text{ for all } r \in N \right]\]
\[ = 2^{r + 1} \geq 3\left( r + 1 \right) \]
\[\text{ Hence, P(r + 1) is true } . \]
\[\text{ However, we cannot conclude that }  P\left( n \right) \text{ is true for all n } \in N . \]
\[P(1): 2^1 \not\geq 3 . 1\]
\[\text{ Therefore } , P\left( n \right) \text{ is not true for all n }  \in N .\]

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 12: Mathematical Induction - Exercise 12.2 [पृष्ठ २८]

APPEARS IN

आर.डी. शर्मा Mathematics [English] Class 11
अध्याय 12 Mathematical Induction
Exercise 12.2 | Q 35 | पृष्ठ २८

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

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

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

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


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

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

Prove the following by using the principle of mathematical induction for all n ∈ N: `1/2 + 1/4 + 1/8 + ... + 1/2^n = 1 - 1/2^n`

 

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

`1/2.5 + 1/5.8 + 1/8.11 + ... + 1/((3n - 1)(3n + 2)) = n/(6n + 4)`

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+2+ 3+...+n<1/8(2n +1)^2`


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


If P (n) is the statement "n(n + 1) is even", then what is P(3)?


Given an example of a statement P (n) such that it is true for all n ∈ N.

 

If P (n) is the statement "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not 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.


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

 

a + ar + ar2 + ... + arn−1 =  \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]

 

(ab)n = anbn for all n ∈ N. 

 

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.  

 


Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] N .

 

\[\text{ A sequence }  a_1 , a_2 , a_3 , . . . \text{ is defined by letting }  a_1 = 3 \text{ and } a_k = 7 a_{k - 1} \text{ for all natural numbers } k \geq 2 . \text{ Show that } a_n = 3 \cdot 7^{n - 1} \text{ for all } n \in N .\]


\[\text{ A sequence } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{  for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n }  \in N \text{ using mathematical induction .} \]


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

12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 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/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`


Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 2. 


The distributive law from algebra says that for all real numbers c, a1 and a2, we have c(a1 + a2) = ca1 + ca2.

Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a1, a2, ..., an are any real numbers, then c(a1 + a2 + ... + an) = ca1 + ca2 + ... + can.


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


Give an example of a statement P(n) which is true for all n. Justify your answer. 


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:

For any natural number n, 7n – 2n is divisible by 5.


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:

n3 – n is divisible by 6, for each natural number n ≥ 2.


Prove the statement by using the Principle of Mathematical Induction:

n(n2 + 5) is divisible by 6, for each natural number n.


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 that for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin  beta/2)`.


Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ 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×