tabacus

Welcome to tabacus!

Thanks for trying out our beta!

As a sign of our gratitude, we've given you free access to all Pro features for the duration of the beta, and you'll get an exclusive discount when the app is fully released.

Expect frequent updates and fixes. We're working hard to make the app as good as possible, so any feedback is highly appreciated!

By using tabacus you agree to the Terms of Service and Privacy Policy.

Send feedback

Your profile

A square crop is kept, 256 × 256.
Change password

Leave both blank to keep your password. You don't need your old one: choose a new password here and save. Never set one? This sets it.

Clear this sheet?

You can undo it for a few seconds afterward.

Delete your account?

This permanently deletes the account and everything saved to it: your synced sheets, equations, materials and constants, your profile and picture, saved files, and connected AI apps. It can't be undone.

The work open in this browser stays here.

Save document

Open a document

Draw a molecule

Click an atom to grow a chain, drag from it to draw a bond, click a bond to make it double or triple. Keys: C N O S, 1 2 3 for bonds, B for benzene, E to erase.

Export this tab


    

Sum of the first n squares

The sum of the first n squares, 1^2 + 2^2 + ... + n^2, has the closed form n(n+1)(2n+1)/6. Tabacus shows the formula and proves it.

Answer. sum(i^2,i,1,n) = n(n+1)(2n+1)/6

Worked solution

Claim: Σ_{i=1}^{n} (i^2) = (n(n+1)(2n+1))/(6), for all n ≥ 1.

Proof. By induction on n.

Base case (n = 1): the left side is 1 and the right side is 1, which agree, so the claim holds for n = 1.

Inductive hypothesis: assume for some integer k ≥ 1 that Σ_{i=1}^{k} (i^2) = (k(k+1)(2k+1))/6.

Inductive step: we show the claim for k + 1.
  Σ_{i=1}^{k+1} (i^2)
    = Σ_{i=1}^{k} (i^2) + (k+1)^2
    = ((1/3)k^3 + (1/2)k^2 + (1/6)k) + (k^2 + 2k + 1)      [by the inductive hypothesis]
    = (1/3)k^3 + (3/2)k^2 + (13/6)k + 1
    = ((k+1)(k+2)(2k+3))/6.
  This is the right side at n = k + 1, so the claim holds for k + 1.

By the principle of induction, the claim holds for all n ≥ 1. ∎

Frequently asked questions

What is the formula for the sum of squares?

It is n(n+1)(2n+1)/6.

Is there a proof?

Yes, Tabacus proves it by induction, step by step.

Related tools

All tabacus tools

The calculator above is already loaded with this problem, edit it or type your own.