Question
Question: Show by induction, that \[\forall n\ge 1,\]\[{{1}^{2}}+{{3}^{2}}+{{5}^{2}}+.....+{{\left( 2n-1 \righ...
Show by induction, that \forall n\ge 1,$$$${{1}^{2}}+{{3}^{2}}+{{5}^{2}}+.....+{{\left( 2n-1 \right)}^{2}}=\dfrac{n}{3}\left( 4{{n}^{2}}-1 \right)?
Solution
This problem is based on an induction method, which is used to prove a statement where n represents the set of all natural numbers. It involves two steps, first one is the statement which is true for n = 1 and n = 2 and the second is true for n = k and prove that if it is true for n = k, then it is also true for n = k+1. We can do it step by step to prove the given expression.
Complete step by step solution:
We have to show that,
12+32+52+.....+(2n−1)2=3n(4n2−1)
We can now write the first step,
For 12+32+52+.....+(2n−1)2=3n(4n2−1), we can take n = 1, we get
⇒12=31(4×12−1)=1
For 12+32+52+.....+(2n−1)2=3n(4n2−1), we can take n = 2, we get
⇒12+32=32(4×22−1)=32×15=10
Hence, we can see that the given statement is true for n = 1 and n = 2.
We can now write the second step,
For 12+32+52+.....+(2n−1)2=3n(4n2−1), we can take n = k, we get
⇒12+32+52+.....+(2k−1)2=3k(4k2−1)
For 12+32+52+.....+(2n−1)2=3n(4n2−1), we can take n = k+1, we get