हिंदी

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.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/3]`


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

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: 102n – 1 + 1 is divisible by 11


Prove the following by using the principle of mathematical induction for all n ∈ Nx2n – y2n is divisible by x y.


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.

 

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

 

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


1.2 + 2.22 + 3.23 + ... + n.2= (n − 1) 2n+1+2

 

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

 

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

 

32n+7 is divisible by 8 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.  

 


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


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

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.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`


Answer the following:

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

2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n 


Answer the following:

Prove by method of induction

`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀  "n" ∈ "N"`


Answer the following:

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


The distributive law from algebra says that for all real numbers c, a1 and a2, we have c(a1 + a2) = ca1 + ca2.

Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a1, a2, ..., an are any real numbers, then c(a1 + a2 + ... + an) = ca1 + ca2 + ... + can.


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 – n is divisible by 6, for each natural number n ≥ 2.


Prove the statement by using the Principle of Mathematical Induction:

2 + 4 + 6 + ... + 2n = n2 + n 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.


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 for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin  beta/2)`.


Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×