Faulhaber's formula¶

A Bernoulli-number polynomial formula for the sum of equal nonnegative integer powers over the first n positive integers.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4516
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Enumerative Number Theory → Mathematics

Core Idea¶

For fixed p, the power sum is a polynomial in n of degree p plus one; Bernoulli-number sign conventions, whether summation begins at zero or one and treatment of p equals zero must be fixed. Generating functions or finite differences express discrete antidifferentiation of n^p, and Bernoulli coefficients supply the unique polynomial whose forward difference is the next power. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

The Adding-Up Shortcut

Adding 1 + 2 + 3 + 4 all the way up to a big number takes forever. Faulhaber's formula is a shortcut recipe that gives you the answer in one go. It even works if you first multiply each number by itself, or by itself again, before adding.

Power-Sum Recipe

Suppose you want to add up the first n counting numbers, or their squares (1, 4, 9, 16...), or their cubes. Faulhaber's formula gives a shortcut: for each kind of power, the total can be written as a formula in n that you plug a number into. The formula uses powers of n, and its highest power is one more than the power you're adding up. Special numbers called Bernoulli numbers tell you what goes in the formula. You have to be careful about details, like whether you start counting at 0 or at 1.

Polynomial Formula for Power Sums

Faulhaber's formula says that for a fixed whole-number exponent p, the power sum 1^p + 2^p + ... + n^p equals a polynomial in n of degree p + 1. For example, with p = 1 you get n(n+1)/2, a degree-2 polynomial. The coefficients of the general polynomial come from binomial coefficients and Bernoulli numbers. You can think of it as the discrete version of integration: just as integrating x^p gives a power one higher, summing n^p gives a polynomial one degree higher. To use it correctly you must fix conventions, such as which sign convention for Bernoulli numbers you use, whether the sum starts at 0 or 1, and how to handle p = 0.

Faulhaber's formula expresses the power sum of the first n integers raised to a fixed nonnegative integer exponent p as an explicit polynomial in n of degree p + 1. Its coefficients are built from binomial coefficients and Bernoulli numbers. Conceptually it is discrete antidifferentiation: one seeks the polynomial whose forward difference equals the next power, and the Bernoulli coefficients supply the unique such polynomial (given a normalization). Proofs can go through generating functions or finite differences. The degree and leading term (n^(p+1)/(p+1)) mirror the continuous integral of x^p. Because results look different under different conventions, one must state the Bernoulli-number sign convention (B1 = +1/2 or -1/2), whether summation starts at 0 or 1, and how p = 0 is treated. Mixing conventions is a common source of apparently wrong formulas.

Scope of Application¶

Faulhaber's formula belongs to enumerative number theory and is useful where the analyst can specify the typed enumerative number theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the nonnegative integer exponent and integer upper limit, summation bounds, Bernoulli-number convention, binomial coefficients, polynomial formula, degree and leading term, edge cases and proof convention are explicit. The scope is broad within that domain but bounded by the need for the nonnegative integer exponent and integer upper limit, summation bounds, Bernoulli-number convention, binomial coefficients, polynomial formula, degree and leading term, edge cases and proof convention are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the nonnegative integer exponent and integer upper limit, summation bounds, Bernoulli-number convention, binomial coefficients, polynomial formula, degree and leading term, edge cases and proof convention are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Faulhaber's formula can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Faulhaber's formula. Faulhaber's formula compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed enumerative number theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the nonnegative integer exponent and integer upper limit, summation bounds, Bernoulli-number convention, binomial coefficients, polynomial formula, degree and leading term, edge cases and proof convention are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of enumerative number theory because they reuse the typed enumerative number theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Generating functions or finite differences express discrete antidifferentiation of n^p, and Bernoulli coefficients supply the unique polynomial whose forward difference is the next power., and type the carrier, state every parameter and convention in the definition, test that the nonnegative integer exponent and integer upper limit, summation bounds, Bernoulli-number convention, binomial coefficients, polynomial formula, degree and leading term, edge cases and proof convention are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Faulhaber's formula Domain-specific

Parents (1) — outgoing typed relations

Faulhaber's formula is a kind of Accumulation Prime

It remains its own entry because its identity is fixed by the nonnegative integer exponent and integer upper limit, summation bounds, Bernoulli-number convention, binomial coefficients, polynomial formula, degree and leading term, edge cases and proof convention.

Hierarchy path (1) — routes to 1 parentless root

Faulhaber's formula → is a kind of Accumulation

Neighborhood in Abstraction Space¶

Faulhaber's formula sits in a crowded region of the domain-specific corpus (4^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Integer & Divisor Number Theory (45 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25