हिंदी

Prove by method of induction, for all n ∈ N: 13.5+15.7+17.9+... to n terms = n3(2n+3) - Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

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

`1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`

योग

उत्तर

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

But the first factor in each term of the denominator

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)

Also, second factor in each term of denominator

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

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

∴ nth term tn = `1/((2"n" + 1)(2"n" + 3))`

∴ P(n) ≡ `1/(3.5) + 1/(5.7) + 1/(7.9) + ...  + 1/((2"n" + 1)(2"n" + 3)) = "n"/(3(2"n" + 3))`

Step I:

Put n = 1

L.H.S. = `1/(3.5) = 1/15`

R.H.S. = `1/(3[2(1) + 3]) = 1/(3(2 + 3)) = 1/15` = 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.5) + 1/(5.7) + 1/(7.9) + ...  + 1/((2"k" + 1).(2"k" + 3)) = "k"/(3(2"k" + 3))`   ...(i)

Step III:

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

i.e., to prove that

`1/(3.5) + 1/(5.7) + 1/(7.9) + ...  + 1/((2"k" + 3).(2"k" + 5)) = ("k" + 1)/(3(2"k" + 5))` 

L.H.S. = `1/(3.5) + 1/(5.7) + 1/(7.9) + ...  + 1/((2"k" + 3)(2"k" + 5))` 

= `1/(3.5) + 1/(5.7) + 1/(7.9) + ...  + 1/((2"k" + 1)(2"k" + 3)) + 1/((2"k" + 3)(2"k" + 5))`

= `"k"/(3(2"k" + 3)) + 1/((2"k" + 3)(2"k" + 5))` ...[From (i)]

= `("k"(2"k" + 5) + 3)/(3(2"k" + 3)(2"k" + 5))`

= `(2"k"^2 + 5"k" + 3)/(3(2"k" + 3)(2"k" + 5))`

= `(2"k"^2 + 2"k" + 3"k" + 3)/(3(2"k" + 3)(2"k" + 5)`

= `(2"k"("k" + 1) + 3("k" + 1))/(3(2"k" + 3)(2"k" + 5))`

= `((2"k" + 3)("k" + 1))/(3("2k" + 3)(2"k" + 5))`

= `("k" + 1)/(3(2"k" + 5))`

= 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.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))` 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] 11 Standard Maharashtra State Board
अध्याय 4 Methods of Induction and Binomial Theorem
Exercise 4.1 | Q 9 | पृष्ठ ७४

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

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


If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.

 

If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.

 

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}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]

 


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


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

 

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


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

 

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

 

Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all \[\in\] N .

 

\[\text{ Prove that } \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ for all n } \in N .\]

 


\[\text{ 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) \text{ for }  n \geq 2, \text{ where } a > 0, A > 0 . \]
\[\text{ 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} .\]


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

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:

5 + 52 + 53 + .... + 5n = `5/4(5^"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

12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`


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

`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 2. 


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

22n – 1 is divisible by 3.


Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.


Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.


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


Prove the statement by using the Principle of Mathematical Induction:

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


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, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin  ((n + 1))/2 theta)/(sin  theta/2)`, for all n ∈ N.


If P(n): 2n < n!, n ∈ N, then P(n) is true for all 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×