मराठी
महाराष्ट्र राज्य शिक्षण मंडळएचएससी विज्ञान (सामान्य) इयत्ता ११ वी

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 2 (Arts and Science) [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.2.3 + 2.3.4 + … + n(n + 1) (n + 2)  = `(n(n+1)(n+2)(n+3))/(4(n+3))`


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

1.3 + 3.5 + 5.7 + ...+(2n -1)(2n + 1) = `(n(4n^2 + 6n -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: `1+2+ 3+...+n<1/8(2n +1)^2`


Prove the following by using the principle of mathematical induction for all n ∈ Nn (n + 1) (n + 5) is a multiple of 3.


Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.


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 "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.


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


52n+2 −24n −25 is divisible by 576 for all n ∈ N.

 

(ab)n = anbn for all n ∈ N. 

 

n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.

 

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

 

\[1 + \frac{1}{4} + \frac{1}{9} + \frac{1}{16} + . . . + \frac{1}{n^2} < 2 - \frac{1}{n}\] for all n ≥ 2, n ∈ 

 


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

2 + 4 + 6 + ..... + 2n = n (n+1)


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

13 + 33 + 53 + .... to n terms = n2(2n2 − 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:

(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)


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


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

1 + 3 + 5 + ... + (2n – 1) = n2 


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


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"):}`


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:

n3 – 7n + 3 is divisible by 3, for all natural numbers n.


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:

1 + 2 + 22 + ... + 2n = 2n+1 – 1 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 d1, d2, d3 ... is defined by letting d1 = 2 and dk = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that dn = `2/(n!)` for all n ∈ N.


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


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


Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.


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


If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.


State whether the following statement is true or false. Justify.

Let P(n) be a statement and let P(k) ⇒ P(k + 1), for some natural number k, then P(n) is true for all n ∈ N.


By using principle of mathematical induction for every natural number, (ab)n = ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×