English

52n+2 −24n −25 is Divisible by 576 for All N ∈ N.

Advertisements
Advertisements

Question

52n+2 −24n −25 is divisible by 576 for all n ∈ N.

 
Advertisements

Solution

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

\[P(n): 5^{2n + 2} - 24n - 25 \text{ is divisible by 576 for all } n \in N . \]
\[\text{ Step}  1: \]
\[P(1) = 5^{2 + 2} - 24 - 25 = 625 - 49 = 576 \]
\[\text{ It is divisible by 576 . } \]
\[\text{ Thus, P(1) is true }  . \]
\[\text{ Step2:}  \]
\[\text{ Let P(m) be true . } \]
\[\text{ Then, } \]
\[ 5^{2m + 2} - 24m - 25\text{  is divisible by 576 } . \]
\[\text{ Let } 5^{2m + 2} - 24m - 25 = 576\lambda, \text{ where } \lambda \in N . \]
\[\text{ We need to show that P(m + 1) is true whenever P(m) is true } . \]
\[\text{ Now } , \]
\[P(m + 1) = 5^{2m + 4} - 24(m + 1) - 25\]
\[ = 5^2 \times (576\lambda + 24m + 25) - 24m - 49\]
\[ = 25 \times 576\lambda + 600m + 625 - 24m - 49\]
\[ = 25 \times 576\lambda + 576m + 576\]
\[ = 576(25\lambda + m + 1) \]
\[\text{ It is divisible by } 576 . \]
\[\text{ Thus, P(m + 1) is true } . \]
\[\text{ By the principle of mathematical induction, P(n) is true for all } n \in N . \]

shaalaa.com
  Is there an error in this question or solution?
Chapter 12: Mathematical Induction - Exercise 12.2 [Page 28]

APPEARS IN

R.D. Sharma Mathematics [English] Class 11
Chapter 12 Mathematical Induction
Exercise 12.2 | Q 21 | Page 28

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

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

1.3 + 3.5 + 5.7 + ...+(2n -1)(2n + 1) = `(n(4n^2 + 6n -1))/3`

Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2


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 ∈ N (2+7) < (n + 3)2


1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]

 

\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]


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

 

1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]

 

1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]

 

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

 

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

 

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

 

11n+2 + 122n+1 is divisible by 133 for all n ∈ N.

 

Given \[a_1 = \frac{1}{2}\left( a_0 + \frac{A}{a_0} \right), a_2 = \frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) \text{ and }  a_{n + 1} = \frac{1}{2}\left( a_n + \frac{A}{a_n} \right)\] for n ≥ 2, where a > 0, A > 0.
Prove that \[\frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right) 2^{n - 1}\]

 

\[\frac{n^{11}}{11} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{62}{165}n\] is a positive integer for all n ∈ 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


\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\]  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 .\]


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:

(23n − 1) is divisible by 7


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

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


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:

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


Prove by induction that for all natural number n sinα + sin(α + β) + sin(α + 2β)+ ... + sin(α + (n – 1)β) = `(sin (alpha + (n - 1)/2 beta)sin((nbeta)/2))/(sin(beta/2))`


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:

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:

2n < (n + 2)! for all natural number n.


Prove the statement by using the Principle of Mathematical Induction:

2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.


A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.


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


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


For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.


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×