Prove that the sum of squares of the first n natural numbers is n/6(n+1)(2n+1)

In order to do this we must follow the standard procedure for a proof by induction which is to first check a base case:Let n = 1, then the sum can be written as 12 = 1/6(1+1)(2+1) = 1 as required.
Next, assume through this check that the assumption holds for some n = k. (Where the assumption is that the sum of squared natural numbers up to n is equal to n/6(n+1)(2n+1)).
Finally, let n = k + 1 and try to show the assumption is still valid. By showing this is the case for an arbitrary n = k we can see that it will hold for all n in the natural numbers:Would show this on the whiteboard as it is a lot of numbers to type, but it works.

TD

Related Further Mathematics A Level answers

All answers ▸

Expand (1+x)^3. Express (1+i)^3 in the form a+bi. Hence, or otherwise, verify that x = 1+i satisfies the equation: x^3+2*x-4i = 0.


write 2-2i in its modulus argument form


prove by induction that, f(n) = 2^(3n+1) + 3(5^(2n+1)) is divisible by 17 for all n>0.


It is given that f(x) = 2sinhx+3coshx. Show that the curve y = f(x) has a stationary point at x =-½ ln(5) and find the value of y at this point. Solve the equation f(x) = 5, giving your answers exactly