English

1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) = N ( 4 N 2 + 6 N − 1 ) 3 - Mathematics

Advertisements
Advertisements

Question

1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]

 
Advertisements

Solution

Let P(n) be the given statement.
Now,

\[P(n) = 1 . 3 + 3 . 5 + 5 . 7 + . . . + (2n - 1)(2n + 1) = \frac{n(4 n^2 + 6n - 1)}{3}\]

\[\text{ Step }  1: \]

\[P(1) = 1 . 3 = 3 = \frac{1(4 \times \left( 1 \right)^2 + 6 \times 1 - 1)}{3}\]

\[\text{ Hence, P(1) is true }  . \]

\[\text{ Step 2: }  \]

\[\text{ Let P(m) be true} . \]

\[\text{ Then,}  \]

\[1 . 3 + 3 . 5 + . . . + (2m - 1)(2m + 1) = \frac{m(4 m^2 + 6m - 1)}{3}\]

\[\text{ To prove: P(m + 1) is true}  . \]

\[\text{ That is, }  \]

\[1 . 3 + 3 . 5 + . . . + (2m + 1)(2m + 3) = \frac{(m + 1)\left[ 4(m + 1 )^2 + 6\left( m + 1 \right) - 1 \right]}{3}\]

\[ \text{ Now, P(m) is equal to: }  \]

\[1 . 3 + 3 . 5 + . . . + (2m - 1)(2m + 1) = \frac{m(4 m^2 + 6m - 1)}{3}\]

\[ \Rightarrow 1 . 3 + 3 . 5 + . . . + (2m - 1)(2m + 1) + (2m + 1)(2m + 3) = \frac{m(4 m^2 + 6m - 1)}{3} + (2m + 1)(2m + 3) \left[ \text{ Adding } (2m + 1)(2m + 3) \text{ to both sides }  \right]\]

\[ \Rightarrow P(m + 1) = \frac{m(4 m^2 + 6m - 1) + 3(4 m^2 + 8m + 3)}{3}\]

\[ \Rightarrow P(m + 1) = \frac{4 m^3 + 6 m^2 - m + 12 m^2 + 24m + 9}{3} = \frac{4 m^3 + 18 m^2 + 23m + 9}{3}\]

\[ \Rightarrow P(m + 1) = \frac{4m( m^2 + 2m + 1) + 10 m^2 + 19m + 9}{3}\]

\[ = \frac{4m(m + 1 )^2 + (10m + 9)(m + 1)}{3}\]

\[ = \frac{(m + 1)\left[ 4m(m + 1) + 10m + 9 \right]}{3}\]

\[ = \frac{(m + 1)}{3}(4 m^2 + 8m + 4 + 6m + 5)\]

\[ = \frac{(m + 1)\left[ 4(m + 1 )^2 + 6\left( m + 1 \right) - 1 \right]}{3}\]

\[\text{ Thus, P(m + 1) is true .}  \]

\[\text{ By the principle of mathematical induction, P(n) is true for all n}  \in N .\]

shaalaa.com
  Is there an error in this question or solution?
Chapter 12: Mathematical Induction - Exercise 12.2 [Page 27]

APPEARS IN

RD Sharma Mathematics [English] Class 11
Chapter 12 Mathematical Induction
Exercise 12.2 | Q 13 | Page 27

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

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

1.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/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/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: 102n – 1 + 1 is divisible by 11


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 "n(n + 1) is even", then what is P(3)?


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.

 

1 + 2 + 3 + ... + n =  \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(n + 1)}{2}\] .


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

 


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

 

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

 

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

 

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

 


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


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:

Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1


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


Answer the following:

Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2


Answer the following:

Prove by method of induction

`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 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:

`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 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"):}`


State whether the following proof (by mathematical induction) is true or false for the statement.

P(n): 12 + 22 + ... + n2 = `(n(n + 1) (2n + 1))/6`

Proof By the Principle of Mathematical induction, P(n) is true for n = 1,

12 = 1 = `(1(1 + 1)(2*1 + 1))/6`. Again for some k ≥ 1, k2 = `(k(k + 1)(2k + 1))/6`. Now we prove that

(k + 1)2 = `((k + 1)((k + 1) + 1)(2(k + 1) + 1))/6`


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:

32n – 1 is divisible by 8, for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.


Prove the statement by using the Principle of Mathematical Induction:

n(n2 + 5) is divisible by 6, for each natural number n.


Prove the statement by using the Principle of Mathematical Induction:

1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.


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.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×