हिंदी

Prove by method of induction, for all n ∈ N: 1.3 + 3.5 + 5.7 + ..... to n terms = n3(4n2+6n-1)

Advertisements
Advertisements

प्रश्न

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

योग
Advertisements

उत्तर

Let P(n) ≡ 1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`, for all n ∈ N

But the first factor in each term

i.e., 1, 3, 5 … are in A.P. with a = 1 and d = 2.

∴ nth term = a + (n –1)d = 1 +(n – 1)2 = (2n – 1)

Also second factor in each term

i.e., 3, 5, 7, … are in A.P. with a = 3 and d = 2.

∴ nth term = a + (n – 1)d = 3 + (n – 1)2 = (2n+1)

∴ nth term, tn = (2n – 1) (2n + 1)

∴ P(n) ≡ 1.3 + 3.5 + 5.7 + .... + (2n – 1) (2n + 1) = `"n"/3(4"n"^2 + 6"n" - 1)`

Step I:

Put n = 1

L.H.S. = 1.3 = 3

R.H.S. = `1/3[4(1)^2 + 6(1) - 1]` = 3 = L.H.S.

∴ P(n) is true for n = 1.

Step II:

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

∴ 1.3 + 3.5 + 5.7 + ..... + (2k – 1)(2k + 1)

= `"k"/3(4"k"^2 + 6"k" - 1)`   ...(i)

Step III:

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

i.e., to prove that

1.3 + 3.5 + 5.7 + …. + [2(k + 1) – 1][2(k + 1) + 1]

= `(("k" + 1))/3[4("k" + 1)^2 + 6("k" + 1) - 1]`

= `(("k" + 1))/3(4"k"^2 + 8"k" + 4 + 6"k" + 6 - 1)`

= `(("k" + 1))/3(4"k"^2 + 14"k" + 9)`

L.H.S. = 1.3 + 3.5 + 5.7 + ... + [2(k + 1) – 1][2(k + 1) + 1]

= 1.3 + 3.5 + 5.7 + ... + (2k – 1)(2k + 1) + (2k + 1)(2k + 3)

= `"k"/3(4"k"^2 + 6"k" - 1) + (2"k" + 1) (2"k" + 3)`  ...[From (i)]

= `1/3[4"k"^3 + 6"k"^2 - "k" + 3(2"k" + 1)(2"k" + 3)]`

= `1/3(4"k"^3 + 6"k"^2 - "k" + 12"k"^2 + 24"k" + 9)`

= `1/3(4"k"^3 + 18"k"^2 + 23"k" + 9)`

= `1/3("k" + 1)(4"k"^2 + 14"k" + 9)`

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

∴ 1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)` for all n ∈ N.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 4: Methods of Induction and Binomial Theorem - Exercise 4.1 [पृष्ठ ७३]

APPEARS IN

बालभारती Mathematics and Statistics (Arts and Science) Part 2 [English] Standard 11 Maharashtra State Board
अध्याय 4 Methods of Induction and Binomial Theorem
Exercise 4.1 | Q 7 | पृष्ठ ७३

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

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

`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^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 ∈ Nx2n – y2n is divisible by x y.


Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.


If P (n) is the statement "n(n + 1) is even", then what is P(3)?


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


\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\] 


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


72n + 23n−3. 3n−1 is divisible by 25 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 .

  

Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all \[\in\] 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


Show by the Principle of Mathematical induction that the sum Sn 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{ 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:

12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`


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

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


Answer the following:

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


Answer the following:

Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.


Answer the following:

Prove by method of induction 52n − 22n is divisible by 3, for all n ∈ N


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.


Show by the Principle of Mathematical Induction that the sum Sn of the n term of the series 12 + 2 × 22 + 32 + 2 × 42 + 52 + 2 × 62 ... is given by

Sn = `{{:((n(n + 1)^2)/2",",  "if n is even"),((n^2(n + 1))/2",",  "if n is odd"):}`


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:

23n – 1 is divisible by 7, for all natural numbers 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, 7n – 2n is divisible by 5.


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:

`sqrt(n) < 1/sqrt(1) + 1/sqrt(2) + ... + 1/sqrt(n)`, for all natural numbers n ≥ 2.


Prove the statement by using the Principle of Mathematical Induction:

2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.


Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin  ((n + 1))/2 theta)/(sin  theta/2)`, for all n ∈ N.


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×