I need to prove $$\sum_{k=1}^n(2k)^2 = \frac{2n(n+1)(2n+1)}{3}$$ using mathematical induction. I tried solving this but I got stuck when proving that this is true for n=k+1.
I would be very thankful if someone could help me.
I need to prove $$\sum_{k=1}^n(2k)^2 = \frac{2n(n+1)(2n+1)}{3}$$ using mathematical induction. I tried solving this but I got stuck when proving that this is true for n=k+1.
I would be very thankful if someone could help me.
Let's call this expression $\phi(n)$ if $\phi(n)$ is true than $\phi(n+1)$ should also be true
$\phi(n)$ generates your formula above. $$\phi(n+1)=\sum_{k=1}^{n+1}(2k)^2=\sum_{k=1}^{n}(2k)^2+2(n+1)^2$$ $$=\frac{2n\cdot(n+1)(2n+1)}{3}+2(n+1)^2$$ This is the expression we have to check and we have to check that it equals what we have when we plug in $n=n+1$ for the above formula so; $$\frac{2n\cdot(n+1)(2n+1)}{3}+2(n+1)^2=\frac{2(n+1)((n+1)+1)(2(n+1)+1)}{3}$$ Let's workout the operations;$$\frac{2n(n+1)(2n+1)+6(n+1)^2}{3}$$ $$\frac{(n+1)(4n^2+2n+6n+6)}{3}$$ $$\frac{2(n+1)(2n^2+4n+3)}{3}$$ $$\frac{2(n+1)(n+2)(2n+3)}{3}$$ you have to be careful factoring out (n+1)