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

प्रश्न

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

Principle of Mathematical Induction

क्या इस प्रश्न या उत्तर में कोई त्रुटि है?

Q II. (1) (i)Q I. (10)Q II. (1) (ii)

अध्याय 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. (1) (i) | पृष्ठ ८५

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

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+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^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: 10²ⁿ^{– 1}+ 1 is divisible by 11

Prove the following by using the principle of mathematical induction for all n ∈ N: x²ⁿ – y²ⁿ is divisible by x + y.

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.

1 + 3 + 3² + ... + 3ⁿ⁻¹ = \[\frac{3^n - 1}{2}\]

3²ⁿ+7 is divisible by 8 for all n ∈ N.

3²ⁿ⁺² −8n − 9 is divisible by 8 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}\]

Prove that 1 + 2 + 2² + ... + 2ⁿ = 2ⁿ⁺¹ - 1 for all n \[\in\] N .

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

\[\frac{n^{11}}{11} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{62}{165}n\] is a positive integer for all n ∈ N.

\[\frac{1}{2}\tan\left( \frac{x}{2} \right) + \frac{1}{4}\tan\left( \frac{x}{4} \right) + . . . + \frac{1}{2^n}\tan\left( \frac{x}{2^n} \right) = \frac{1}{2^n}\cot\left( \frac{x}{2^n} \right) - \cot x\] for all n ∈ N and \[0 < x < \frac{\pi}{2}\]

x²ⁿ⁻¹ + y²ⁿ⁻¹ is divisible by x + y for all n ∈ N.

\[\text{ Let } P\left( n \right) \text{ be the statement } : 2^n \geq 3n . \text{ If } P\left( r \right) \text{ is true, then show that } P\left( r + 1 \right) \text{ is true . Do you conclude that } P\left( n \right)\text{ is true for all n } \in N?\]

Show by the Principle of Mathematical induction that the sum S_n of then terms of the series \[1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + 2 \times 6^2 + 7^2 + . . .\] is given by \[S_n = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ if n is even} }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ if n is odd } }\]

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