Prove the following

1.3 + 3.5 + 5.7 + ..... +(2n - 1) (2n + 1 ) =n( 4n square + 6n -1)/2 plz explain briefly in a simple method

The said query is:

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

 https://img-nm.mnimgs.com/img/study_content/curr/1/11/11/164/4102/chapter%204_html_32de5642.gif

We will prove it as follows:

Let the given statement be P(n), i.e.,

P(n): https://img-nm.mnimgs.com/img/study_content/curr/1/11/11/164/4102/chapter%204_html_32de5642.gif…(1)

For n = 1, we have

https://img-nm.mnimgs.com/img/study_content/curr/1/11/11/164/4102/chapter%204_html_m5646804c.gif, which is true.

Let P(k) be true for some positive integer k.

Then we must have,

https://img-nm.mnimgs.com/img/study_content/curr/1/11/11/164/4102/chapter%204_html_m75fc59c8.gif

We shall now prove that P(k + 1) is true.

That is, we have to prove that 

(1.3 + 3.5 + 5.7 + … + (2k – 1) (2k + 1) + {2(k + 1) – 1}{2(k + 1) + 1} = https://img-nm.mnimgs.com/img/study_content/curr/1/11/11/164/4102/chapter%204_html_m61479ca9.gif

Taking L.H.S.,

(1.3 + 3.5 + 5.7 + … + (2k – 1) (2k + 1) + {2(k + 1) – 1}{2(k + 1) + 1}

https://img-nm.mnimgs.com/img/study_content/curr/1/11/11/164/4102/chapter%204_html_12450083.gif

https://img-nm.mnimgs.com/img/study_content/curr/1/11/11/164/4102/chapter%204_html_m61479ca9.gif

Thus, P(k + 1) is true whenever P(k) is true.

Hence, by the principle of mathematical induction, statement P(n) is true for all natural numbers i.e., n N.

 

  • 21

plz answer me i need it urgently its not properly explained in ncert solutions

  • 3
What are you looking for?