हिंदी

Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that: 22n – 1 is divisible by 3. - Mathematics

Advertisements
Advertisements

प्रश्न

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

22n – 1 is divisible by 3.

योग
Advertisements

उत्तर

Let the statement P(n) given as

P(n): 22n – 1 is divisible by 3, for every natural number n.

We observe that P(1) is true.

Since 22 – 1 = 4 – 1 = 3

1 is divisible by 3.

Assume that P(n) is true for some natural number k.

i.e., P(k) : 22k – 1 is divisible by 3.

i.e., 22k – 1 = 3q, where q ∈ N,

Now, to prove that P(k + 1) is true,

We have P(k + 1) : `2^(2(k + 1)) - 1`

= `2^(2k + 2)  –  1`

= 22k . 22 – 1

= 22k . 4 – 1

= 3.22k + (22k – 1)

= 3.22k + 3q

= 3(22k + q) = 3m, where m ∈ N,

Thus P(k + 1) is true, whenever P(k) is true.

Hence, by the Principle of Mathematical Induction P(n) is true for all natural numbers n.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 4: Principle of Mathematical Induction - Solved Examples [पृष्ठ ६३]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics [English] Class 11
अध्याय 4 Principle of Mathematical Induction
Solved Examples | Q 4 | पृष्ठ ६३

वीडियो ट्यूटोरियलVIEW ALL [1]

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

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

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


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}\] .


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

 

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

 

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

 

\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]


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

 

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

 

7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]

 

x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.

 

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

 


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

12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`


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:

(24n−1) is divisible by 15


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

Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1


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


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.


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:

4n – 1 is divisible by 3, for each natural number n.


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:

For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.


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:

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.


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×