Ask Questions, Get Answers

Want to ask us a question? Click here
Browse Questions
0 votes

For all $n \geq 1$, prove that \[\] $ 1^2+2^2+3^2+4^4+...+n^2=\large\frac{n(n+1)(2n+1)}{6}$.

Can you answer this question?

1 Answer

0 votes
Let the given statement be $P(n) $, i.e.,
$P(n) :1^2+2^2+3^2+4^4+...+n^2=\large\frac{n(n+1)(2n+1)}{6}$.
For $n=1$, $P(1): 1 = \large\frac{1(1+1)(2 \times 1+1)}{6}$$ = \large\frac{1 \times 2 \times 3 }{6}$$=1$ which is true.
Assume that $P(k)$ is true for some positive integers $k$, i.e.,
We shall now prove that $P(k+1)$ is also true. Now, we have
$ \large\frac{k(k+1)(2k+1)}{6}$$+(k+1)^2\qquad$ [ Using (1) ]
$ = \large\frac{(k+1)(2k^2+7k+6)}{6}$
$ = \large\frac{(k+1)(k+1+1)\{2(k+1)+1\}}{6}$
Thus $P(k+1)$ is true, whenever $P(k)$ is true.
Hence, from the principle of mathematical induction, the statement $P(n)$ is true for all natural numbers $n$.
answered May 2, 2014 by thanvigandhi_1

Related questions

Ask Question
student study plans
JEE MAIN, CBSE, AIPMT Mobile and Tablet App
The ultimate mobile app to help you crack your examinations
Get the Android App