Prove that 1+4+9+...+n^2 = n(n+1)(2n+1)/6.

Consider the case n=1. Then 1(1+1)(2*1+1)/6 = 1 = 1^2 and so the claim is true for n=1. Suppose the claim is true for some positive integer n, so that 1+4+9+...+n^2 = n(n+1)(2n+1)/6. Then by the inductive hypothesis 1+4+9+...+n^2 + (n+1)^2 = (1+4+9+...+n^2) + (n+1)^2 = n(n+1)(2n+1)/6 + (n+1)^2                                                                                      = (n+1)(2n^2 + n + 6(n+1))/6                                                                                      = (n+1)(n+2)(2n+3)/6 which is the claim for n+1. As the claim is true for n=1, it's true for all n by induction.

JR
Answered by James R. Further Mathematics tutor

20553 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

Prove by induction that for all positive integers n , f(n) = 2^(3n+1) + 3*5^(2n+1) , is divisible by 17.


What are the different forms of complex numbers and how do you convert between them?


The set of midpoints of the parallel chords of an ellipse with gradient, constant 'm', lie on a straight line: find its equation; equation of ellipse: x^2 + 4y^2 = 4


Solve the equation 2(Sinhx)^2 -5Coshx=5, giving your answer in terms of natural logarithm in simplest form


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

MyTutor is part of the IXL family of brands:

© 2026 by IXL Learning