हिंदी

Answer the following: Prove, by method of induction, for all n ∈ N - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

Answer the following:

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

8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`

योग

उत्तर

Let P(n) ≡ 8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`, for all n ∈ N

Step I:

Put n = 1

L.H.S. = 8

R.H.S. = `1/2[9(1)+ 7]` = 8 = L.H.S.

∴ P(n) is true for n = 1

Step II:

Let us consider that P(n) is true for n = k

∴ 8 + 17 + 26 + … + (9k – 1) = `"k"/2(9"k" + 7)` ...(i)

Step III:

We have to prove that P(n) is true for n = k + 1

i.e., 8 + 17 + 26 + … + [9(k + 1) – 1]

= `(("k" + 1))/2 [9("k" + 1) + 7]`

= `(("k" + 1))/2 (9"k" + 16)`

L.H.S. = 8 + 17 + 26 + … + [9(k + 1) – 1]

= 8 + 17 + 26 + … + (9k – 1) + [9(k + 1) – 1]

= `"k"/2 (9"k" + 7) + (9"k" + 8)`  ...[From (i)]

= `(9"k"^2 + 7"k" + 18"k" + 16)/2`

= `(9"k"^2 + 25"k" + 16)/2`

= `(9"k"^2 + 9"k" + 16"k" + 16)/2`

= `(9"k"("k" + 1) + 16("k" + 1))/2`

= `(("k" + 1))/2(9"k" + 16)`

= R.H.S.

∴ P(n) is true for n = k + 1

Step IV:

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

∴ 8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)` 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] 11 Standard Maharashtra State Board
अध्याय 4 Methods of Induction and Binomial Theorem
Miscellaneous Exercise 4.2 | Q II. (1) (i) | पृष्ठ ८५

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

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

`1 + 3 + 3^2 + ... + 3^(n – 1) =((3^n -1))/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/2.5 + 1/5.8 + 1/8.11 + ... + 1/((3n - 1)(3n + 2)) = n/(6n + 4)`

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

 

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

 

12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]

 

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

 

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

 


32n+2 −8n − 9 is divisible by 8 for all n ∈ N.


2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.


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

 

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

 


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


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:

3n − 2n − 1 is divisible by 4


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 loga xn = n logax, x > 0, n ∈ N


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

22n – 1 is divisible by 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))`


A student was asked to prove a statement P(n) by induction. He proved that P(k + 1) is true whenever P(k) is true for all k > 5 ∈ N and also that P(5) is true. On the basis of this he could conclude that P(n) is true ______.


Prove the statement by using the Principle of Mathematical Induction:

For any natural number n, 7n – 2n is divisible by 5.


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.


Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.


If 10n + 3.4n+2 + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.


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×