मराठी
महाराष्ट्र राज्य शिक्षण मंडळएचएससी विज्ञान (सामान्य) इयत्ता ११ वी

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

Advertisements
Advertisements

प्रश्न

Answer the following:

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

बेरीज
Advertisements

उत्तर

Let P(n) ≡ 52n – 22n is divisible by 3, for all n ∈ N.

Step 1:

For n = 1, 52n – 22n = 52 – 22 = 25 – 4 = 21, which is divisible by 3.

∴ P(1) is true.

Step 2:

Let us assume that for some k ∈ N, P(k) is true, i.e. 52k – 22k is divisible by 3.

∴ `(5^(2"k") - 2^(2"k"))/3` = m (Say), whre m ∈ N

∴ 52k –  22k = 3m

∴ 52k = 22k + 3m   ...(1)

Step 3:

To prove that P(k + 1) is true, i.e., to prove that `5^(2("k" + 1)) - 2^(2("k" + 1))` is divisible by 3.

Now, `5^(2("k" + 1)) - 2^(2("k" + 1))` = 52k+2 – 22k+2 

= 52k .52 – 22k . 22

= (22k + 3m)25 – 22k . 4    ...[By (1)]

= 25(22k) + 75m – 4(22k)

= 21(22k) + 75m

= 3[7.22k + 25m]

∴ `(5^(2("k" + 1)) - 2^(2("k"+1)))/3` = 7.22k + 25m, where (7.22k + 25m) ∈ N

∴ `5^(2("k" + 1)) - 2^(2("k" + 1))` is divisible by 3

∴ P(k + 1) is true.

Step 4:

From all the above steps and by the principle of mathematical induction P(n) is true for all n ∈ N,

i.e., 52n – 22n is divisible by 3, for all n ∈ N.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 4: Methods of Induction and Binomial Theorem - Miscellaneous Exercise 4.2 [पृष्ठ ८६]

APPEARS IN

बालभारती Mathematics and Statistics (Arts and Science) Part 2 [English] Standard 11 Maharashtra State Board
पाठ 4 Methods of Induction and Binomial Theorem
Miscellaneous Exercise 4.2 | Q II. (11) (iii) | पृष्ठ ८६

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

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

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


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

`1/1.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`


Prove the following by using the principle of mathematical induction for all n ∈ N: x2n – 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.


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


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

 

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

 

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


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


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

 

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

 

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

 

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

 

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

 

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

  

Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n  \[\in\] N .

 

\[1 + \frac{1}{4} + \frac{1}{9} + \frac{1}{16} + . . . + \frac{1}{n^2} < 2 - \frac{1}{n}\] for all n ≥ 2, 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 { A sequence  } x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_1 = 2 \text{ and }  x_k = \frac{x_{k - 1}}{k} \text{ for all natural numbers } k, k \geq 2 . \text{ Show that }  x_n = \frac{2}{n!} \text{ for all } n \in N .\]


\[\text{ Using principle of mathematical induction, prove that } \sqrt{n} < \frac{1}{\sqrt{1}} + \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{3}} + . . . + \frac{1}{\sqrt{n}} \text{ for all natural numbers } n \geq 2 .\]

 


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

3 + 7 + 11 + ..... + to n terms = n(2n+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:

`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`


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

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


Answer the following:

Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.


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


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:

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


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.


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 `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×