Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Von Staudt-Clausen Theorem

Number Theory

The Von Staudt-Clausen Theorem describes the fractional part of a Bernoulli number, stating that adding the reciprocal of every prime p for which p minus one divides the Bernoulli number's even index to that Bernoulli number always produces an integer. Named for Karl von Staudt and Thomas Clausen, who proved it independently, it explains why the denominators of the Bernoulli numbers are exactly the product of such primes.

Facts
Statement
For a positive integer n, adding 1/p to the Bernoulli number B(2n) for every prime p such that p minus 1 divides 2n produces an integer, so the denominator of B(2n) is the product of all such primes. 1
Proof Year
1840 1
Classification
Statement Form
Identity or Equation 1
Connections

Has Statement Form

Equation, Concepts

Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.

Identity, Concepts

Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.

In Branch

Source Von Staudt-Clausen Theorem (Wikipedia)
Sources
1. Von Staudt-Clausen Theorem (Wikipedia)
Wikimedia Foundation
  • lead section, first sentence
    the von Staudt-Clausen theorem is a result determining the fractional part of Bernoulli numbers, found independently by Karl von Staudt (1840) and Thomas Clausen (1840)
  • lead section, first sentence, parenthetical years
    found independently by Karl von Staudt (1840) and Thomas Clausen (1840)
  • In Branch: Number Theory, Lead sentence
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.