मराठी

72n + 23n−3. 3n−1 Is Divisible by 25 for All N ∈ N.

Advertisements
Advertisements

प्रश्न

72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.

 
Advertisements

उत्तर

Let P(n) be the given statement.
Now,

\[P(n): 7^{2n} + 2^{3n - 3} . 3^{n - 1} \text{ is divisible by } 25 . \]
\[\text{ Step1} : \]
\[P(1): 7^2 + 2^{3 - 3} . 3^{1 - 1} = 49 + 1 = 50 \]
\[\text{ It is divisible by 25}  . \]
\[\text{ Thus, P(1) is true} \]
\[\text{ Step2: Let } P\left( m \right) \text{ be true . } \]
\[\text{ Now } , \]
\[ 7^{2m} + 2^{3m - 3} . 3^{m - 1} \text{ is divisible by}  25 . \]
\[Suppose: \]
\[ 7^{2m} + 2^{3m - 3} . 3^{m - 1} = 25\lambda . . . (1)\]
\[\text{ We have to show that } P\left( m + 1 \right) \text{ is true whenever P(m) is true}  . \]
\[\text{ Now, } \]
\[P\left( m + 1 \right) = 7^{2m + 2} + 2^{3m} . 3^m \]
\[ = 7^{2m + 2} + 7^2 . 2^{3m - 3} . 3^{m - 1} - 7^2 . 2^{3m - 3} . 3^{m - 1} + 2^{3m} . 3^m \]
\[ = 7^2 \left( 7^{2m} + 2^{3m - 3} . 3^{m - 1} \right) + 2^{3m} . 3^m \left( 1 - \frac{49}{24} \right)\]
\[ = 7^2 \times 25\lambda - 2^{3m} . 3^m \times \frac{25}{2^3 . 3^1} \left[ \text{ Using } (1) \right]\]
\[ = 25\left( 49\lambda - 2^{3m - 3} . 3^{m - 1} \right) \]
\[\text{ It is divisible by } 25 . \]
\[\text{ Thus, } P\left( m + 1 \right) \text{ is true .}  \]
\[\text{ By the principle of mathematical induction, P(n) is 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 25 | पृष्ठ २८

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

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

Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2.3 + 2.3.4 + … + n(n + 1) (n + 2)  = `(n(n+1)(n+2)(n+3))/(4(n+3))`


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

1.3 + 2.3^3 + 3.3^3  +...+ n.3^n = `((2n -1)3^(n+1) + 3)/4`

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

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

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 ∈ Nx2n – y2n is divisible by x y.


Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.


Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.


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


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.


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

 

Prove that n3 - 7+ 3 is divisible by 3 for all n \[\in\] N .

  

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


\[\text{ Prove that } \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ for all n } \in N .\]

 


Show by the Principle of Mathematical induction that the sum Sn of then terms of the series  \[1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + 2 \times 6^2 + 7^2 + . . .\] is given by \[S_n = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ if n is even} }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ if n is odd } }\]

 


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 .\]


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

13 + 33 + 53 + .... to n terms = n2(2n2 − 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:

5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`


Answer the following:

Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2


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

1 + 3 + 5 + ... + (2n – 1) = n2 


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

22n – 1 is divisible by 3.


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:

32n – 1 is divisible by 8, 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:

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


Prove the statement by using the Principle of Mathematical Induction:

2n < (n + 2)! for all 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 the statement by using the Principle of Mathematical Induction:

1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

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


Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin  ((n + 1))/2 theta)/(sin  theta/2)`, for all n ∈ N.


Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.


Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.


If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×