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

19275 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

Prove by induction that the sum of the first n integers can be written as (1/2)(n)(n+1).


You are given a polynomial f, where f(x)=x^4 - 14x^3 + 74 x^2 -184x + 208, you are told that f(5+i)=0. Express f as the product of two quadratic polynomials and state all roots of f.


Prove by induction that 1^2 + 2^2 + 3^2 + . . . + n^2 = (1/6)n(n+1)(2n+1)


Prove that matrix multiplication is not commutative.


We're here to help

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

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences