हिंदी

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

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 2 (Arts and Science) [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^3 +  2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^2`


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

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

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

1/1.2.3 + 1/2.3.4 + 1/3.4.5 + ...+ `1/(n(n+1)(n+2)) = (n(n+3))/(4(n+1) (n+2))`

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

(1+3/1)(1+ 5/4)(1+7/9)...`(1 + ((2n + 1))/n^2) = (n + 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 ∈ Nn (n + 1) (n + 5) is a multiple of 3.


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


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.

 

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.


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


1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.

 

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

 

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

 


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


2.7n + 3.5n − 5 is divisible by 24 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^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.  

 


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


\[\text{ Prove that }  \frac{1}{n + 1} + \frac{1}{n + 2} + . . . + \frac{1}{2n} > \frac{13}{24}, \text{ for all natural numbers } n > 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:

1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"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:

3n − 2n − 1 is divisible by 4


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

(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)


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


Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.

Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula an = 2.5n–1 for all natural numbers.


Prove the statement by using the Principle of Mathematical Induction:

4n – 1 is divisible by 3, for each natural number 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:

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.


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, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.


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


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


By using principle of mathematical induction for every natural number, (ab)n = ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×