English

52n −1 is Divisible by 24 for All N ∈ N.

Advertisements
Advertisements

Question

52n −1 is divisible by 24 for all n ∈ N.

Advertisements

Solution

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

\[P(n): 5^{2n} - 1 \text{ is divisible by 24 for all n } \in N . \]
\[\text{ Step 1} : \]
\[P(1) = 5^2 - 1 = 25 - 1 = 24 \]
\[\text{ It is divisible by } 24 . \]
\[\text{ Thus, P(1) is true . } \]
\[\text{ Step }  2: \]
\[\text{ Let P(m) be true .}  \]
\[\text{ Then, } 5^{2m} - 1\text{  is divisible by 24 } . \]
\[\text{ Now, let} 5^{2m} - 1 = 24\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 + 2} - 1\]
\[ = 5^{2m} 5^2 - 1\]
\[ = 25(24\lambda + 1) - 1\]
\[ = 600\lambda + 24\]
\[ = 24(25\lambda + 1)\]
\[\text{ It is divisible by 24 .}  \]
\[\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 19 | 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 + 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+ 3+...+n<1/8(2n +1)^2`


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 "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.

 

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

 

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

 

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

 

1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]

 

a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]

 


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

 

Prove that n3 - 7+ 3 is divisible by 3 for all n \[\in\] 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.  

 


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

 


\[\text{ Prove that }  \frac{1}{n + 1} + \frac{1}{n + 2} + . . . + \frac{1}{2n} > \frac{13}{24}, \text{ for all natural numbers } n > 1 .\]

 


\[\text{ 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) \text{ for }  n \geq 2, \text{ where } a > 0, A > 0 . \]
\[\text{ 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} .\]


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:

13 + 33 + 53 + .... to n terms = n2(2n2 − 1)


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 by method of induction, for all n ∈ N:

3n − 2n − 1 is divisible by 4


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


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

2n + 1 < 2n, for all natual numbers n ≥ 3.


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:

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


Prove the statement by using the Principle of Mathematical Induction:

2n < (n + 2)! for all natural number 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.


Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×