ForHosting KIT · Math

Sum of the first n cubes calculator

The first 10 cubes add up to 3025, the square of the triangular number 55. Enter any whole number n up to 13776 and get the exact total, the triangular number behind it and the formula to show beside your answer. Free in your browser.

Free
Runs in your browser
No sign-up
Your data stays on your device

Run — free How it works & API

Use it from WebAPIEmailTelegramApp soon

Worked example

If you enter

N: 10

You get

Sum: 3,025
Triangular: 55
Identity: 1^3+2^3+...+n^3 = (n(n+1)/2)^2
Max n: 13,776

The sum of the first n perfect cubes is one of the classic closed-form identities in discrete mathematics and precalculus: one cubed plus two cubed plus three cubed and so on up to n cubed equals the square of the triangular number n times n plus one over two. Students meet this formula when learning induction proofs, series summation, and the relationship between cubes and triangular numbers. Engineers and data scripts need the same value without looping over large n when only the total is required. This sum of the first n cubes calculator accepts a non-negative integer n, evaluates the identity with exact integer arithmetic, and returns the sum, the intermediate triangular number, and a short formula string you can show next to the answer.

The closed-form identity and why it is exact

Nicomachus’s theorem states that the sum of the first n positive cubes equals the square of the n-th triangular number. In symbols, one cubed plus two cubed plus three cubed continuing through n cubed is identical to the quantity n times n plus one, divided by two, then squared. The triangular number T_n equals n(n+1)/2 because that is how many dots sit in a triangle with n rows, or equivalently how many pairs you can form from n plus one consecutive integers when pairing first with last.

Squaring T_n yields the cube sum without enumerating each cube. For n equals one the identity is trivial: one cubed equals one, and T_1 squared is also one. For n equals two you get one plus eight equals nine, and T_2 equals three so three squared equals nine.

For n equals ten the triangular number is fifty-five and the sum of cubes is three thousand twenty-five. The proof by mathematical induction is standard: the base case n equals zero or one holds, and the inductive step uses the algebraic identity that T_n squared plus the next cube n plus one cubed equals T_{n+1} squared. Because every step is exact integer arithmetic, there is no rounding error when n stays inside the safe integer range.

This calculator therefore never approximates the sum with floating-point accumulation of successive cubes; it multiplies and divides once with big-integer intermediates and returns a number that matches hand calculation and textbook tables for every supported n.

What you can do with it

Homework and induction checks

Let students enter n and verify that 1³+…+n³ equals (n(n+1)/2)² against their induction proof steps.

LMS and exam auto-grading

Mark sum-of-cubes items with a deterministic oracle that rejects negative n and never drifts from the closed form.

FAQ

What formula does the sum of the first n cubes calculator use?

It uses Nicomachus’s theorem: 1³+2³+…+n³ = (n(n+1)/2)², the square of the n-th triangular number, evaluated with exact integer arithmetic.

What happens if n is negative?

The sum of the first n cubes is defined for a non-negative count; negative n is not billed.

What is the sum of the first 10 cubes?

It is 3025. The 10th triangular number is 55, the sum of the numbers from 1 to 10, and 55 squared gives 3025, the same total as adding every cube from 1 up to 1000.

What is Nicomachus's theorem?

It says the sum of the first n cubes equals the square of the n-th triangular number, n(n+1)/2. With n of 2, 1 plus 8 is 9, and the triangular number 3 squared is also 9.

Is there a largest n the calculator accepts?

Yes, n can go up to 13776. That limit keeps the squared triangular number within the range where whole numbers are stored exactly, so every total you get is exact rather than rounded.

Related tools

For developers — API access

Everything on this page is available programmatically. This section is for teams who want to wire it into their own systems; everyone else can just use the tool above.

API endpoint

POSThttps://api.kit.forhosting.com/calculus/sum-of-cubes-formula

Prefer to automate it? One authenticated POST creates the task; the result comes back by webhook or a signed link. The same capability also runs here on the web, by email and from Telegram — and soon from our app too.

Call it from your stack

curl -X POST https://api.kit.forhosting.com/calculus/sum-of-cubes-formula \
  -H "Authorization: Bearer $KIT_KEY" \
  -H "Content-Type: application/json" \
  -d '{"n":10}'

const res = await fetch("https://api.kit.forhosting.com/calculus/sum-of-cubes-formula", {
  method: "POST",
  headers: {
    "Authorization": `Bearer ${process.env.KIT_KEY}`,
    "Content-Type": "application/json"
  },
  body: JSON.stringify({
    "n": 10
  })
});
const { task_id } = await res.json();

import os, requests

res = requests.post(
    "https://api.kit.forhosting.com/calculus/sum-of-cubes-formula",
    headers={"Authorization": f"Bearer {os.environ['KIT_KEY']}"},
    json={
    "n": 10
},
)
task_id = res.json()["task_id"]

<?php
$res = file_get_contents("https://api.kit.forhosting.com/calculus/sum-of-cubes-formula", false, stream_context_create([
  "http" => [
    "method"  => "POST",
    "header"  => "Authorization: Bearer " . getenv("KIT_KEY") . "\r\nContent-Type: application/json",
    "content" => '{"n":10}',
  ],
]));
$task = json_decode($res, true);

body := bytes.NewBufferString(`{"n":10}`)
req, _ := http.NewRequest("POST", "https://api.kit.forhosting.com/calculus/sum-of-cubes-formula", body)
req.Header.Set("Authorization", "Bearer "+os.Getenv("KIT_KEY"))
req.Header.Set("Content-Type", "application/json")
res, _ := http.DefaultClient.Do(req)

Example request

{
  "n": 10
}

Example response

{
  "task_id": "tsk_a1b2c3d4e5f6a1b2c3d4e5f6",
  "type": "calculus.sum_of_cubes_formula",
  "status": "queued",
  "_links": {
    "result": "/tasks/tsk_…/result"
  }
}

The API is asynchronous: the call returns a task_id immediately and the result arrives by webhook. Polling is capped at 1 req/s per task.

Pricing

Per request$0.002

Published price — no tokens, no invented credits. A failed task is never charged.

Errors

HTTP	Code	Meaning
`401`	`unauthorized`	Missing or invalid API key.
`402`	`insufficient_balance`	Your balance doesn't cover the task price.
`404`	`unknown_type`	That task type doesn't exist.
`429`	`rate_limited`	Too many requests. Use the webhook instead of polling.

Technical notes

The browser path and the API path share one pure module so homework checks and production pipelines never disagree on edge cases such as n equals zero or the upper safe range.

Input contract, response fields, and validation

Negative n is rejected because the phrase first n cubes is defined for a non-negative count; n equals zero returns sum zero by the empty-sum convention. Send a JSON body with a single required field n: a non-negative integer from zero through thirteen thousand seven hundred seventy-six. Aliases count and k are accepted so scripts that already name the upper index differently do not need a rename step. Values may arrive as JSON numbers or as plain decimal digit strings; leading zeros on multi-digit strings, scientific notation, fractions, Infinity, and NaN are rejected with invalid_input. The upper bound is chosen so that the squared triangular number still fits inside JavaScript’s safe integer range, which keeps results exact when serialised as JSON numbers. On success the response echoes n, returns sum as the total of the first n cubes, triangular as T_n equals n(n+1)/2, formula as the string (n(n+1)/2)^2, identity as a human-readable restatement of Nicomachus’s theorem, and max_n so clients can document the supported range without hard-coding a magic constant. Failed validation does not consume prepaid balance. Pair this endpoint with your own loop only when you need a partial list of each cube; when you need only the total, the closed form is both faster and free of accumulation error.

Classroom, automation, and SEO use cases

Algebra and discrete-math courses use a sum of the first n cubes calculator so learners can check induction homework and series exercises without arithmetic slips on large n. Exam generators and LMS plugins need a deterministic oracle that returns the same sum for the same n every time and that fails loudly on negative input rather than inventing a signed empty sum.

Integration use cases

Scripts and series regression tests

Compare a loop over cubes to the closed-form sum in CI so cubic aggregation code stays aligned with Nicomachus’s identity.

Technical questions

What values of n are allowed?

Non-negative integers from 0 through 13776 inclusive. n=0 returns sum 0. Values above the max would exceed the safe JSON integer range and are rejected.

Does the API loop over each cube?

No. It evaluates the closed form (n(n+1)/2)² in constant time with BigInt intermediates, so results stay exact without accumulating floating error.

What does the sum of cubes calculator cost?

The browser tool is free. API requests use prepaid KIT balance at $0.002 per successful call; invalid input is not billed.

Read the full KIT documentation →

Run — free