Sum of the squares of "n" Consecutive integers - Simple Proof

avatar
(Edited)

In this video I show the proof for determining the formula for the sum of the squares of "n" consecutive integers, i.e. 12 + 22 + 32 +.... + n2. This is a pretty abstract proof and makes use of the useful "telescoping" or collapsing sum which I illustrate in the video. The formula for the sum of squares comes up very often in calculus so it's a good idea to understand the proof!


Watch video on:

Download video notes: https://1drv.ms/b/s!As32ynv0LoaIiZ5RmrYZJRCFRfXYlQ?e=Kf3bTe


View Video Notes Below!


Download these notes: Link is in video description.
View these notes as an article: https://peakd.com/@mes
Subscribe via email: http://mes.fm/subscribe
Donate! :) https://mes.fm/donate
Buy MES merchandise! https://mes.fm/store
More links: https://linktr.ee/matheasy

Reuse of my videos:

  • Feel free to make use of / re-upload / monetize my videos as long as you provide a link to the original video.

Fight back against censorship:

  • Bookmark sites/channels/accounts and check periodically
  • Remember to always archive website pages in case they get deleted/changed.

Recommended Books:

Subscribe to MES Truth: https://mes.fm/truth
MES Links Telegram channel: https://t.me/meslinks

Join my forums!

Follow along my epic video series:


NOTE #1: If you don't have time to watch this whole video:

Browser extension recommendations:


Sum of the squares of “n” positive integers

Proof of sum of n squares.PNG

Simple Proof

We start off the proof with the “telescoping sum” (or the collapsing sum):

image.png

image.png

image.png

image.png

Example

image.png



0
0
0.000
2 comments
avatar

telescoping sum? Wow! you learn something new each day on the internet.

0
0
0.000