Wednesday, 10 July 2019

discrete mathematics - Using induction to verify the formula for a summation $sum_{k=1}^n k^2 = frac{n(n+1)(2n+1)}6$


Problem 4. use the principle of induction to verify:
$$\sum_{k=1}^n k^2 = \frac{n(n+1)(2n+1)}6$$




enter image description here



base case is obviously easy, but I don't know how to prove the inductive case

-

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...