English

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

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

RD 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.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

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

If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.


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

 

1 + 2 + 3 + ... + n =  \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(n + 1)}{2}\] .


12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .

 

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

 

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

 

2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.


\[\frac{1}{2}\tan\left( \frac{x}{2} \right) + \frac{1}{4}\tan\left( \frac{x}{4} \right) + . . . + \frac{1}{2^n}\tan\left( \frac{x}{2^n} \right) = \frac{1}{2^n}\cot\left( \frac{x}{2^n} \right) - \cot x\] for all n ∈ and  \[0 < x < \frac{\pi}{2}\]

 


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


\[\sin x + \sin 3x + . . . + \sin (2n - 1)x = \frac{\sin^2 nx}{\sin x}\]

 


\[\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:

2 + 4 + 6 + ..... + 2n = n (n+1)


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:

(23n − 1) is divisible by 7


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

`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N


Answer the following:

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

12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`


Answer the following:

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

`1/(3.4.5) + 2/(4.5.6) + 3/(5.6.7) + ... + "n"/(("n" + 2)("n" + 3)("n" + 4)) = ("n"("n" + 1))/(6("n" + 3)("n" + 4))`


Answer the following:

Prove by method of induction loga xn = n logax, x > 0, n ∈ N


Answer the following:

Prove by method of induction 52n − 22n is divisible by 3, for all n ∈ N


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))`


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:

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


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:

n2 < 2n for all natural numbers n ≥ 5.


A sequence a1, a2, a3 ... is defined by letting a1 = 3 and ak = 7ak – 1 for all natural numbers k ≥ 2. Show that an = 3.7n–1 for all natural numbers.


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 10n + 3.4n+2 + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×