Mathematics Atlas

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

Lochs' Theorem

Number Theory

Lochs' theorem, proved by Gustav Lochs in 1964, describes how quickly the continued fraction expansion of a typical real number converges compared to its decimal expansion. For almost every real number between 0 and 1, each additional term of the continued fraction yields on average about 0.97 of a decimal digit of accuracy, a limit equal to six times the natural logarithm of 2 times the natural logarithm of 10, divided by pi squared. The golden ratio is a notable exception, since its continued fraction consists entirely of ones and needs about 2.39 terms per decimal digit, the slowest possible rate, matching its reputation as the most irrational number. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Classification
Statement Form
Identity or Equation 1
Proof Year
1964 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 Lochs's theorem (Wikipedia)
Sources
1. Lochs's theorem (Wikipedia)
In Branch: Number Theory, Lead sentence
Quote, In Branch: Number Theory, Lead sentence
In number theory, Lochs's theorem concerns the rate of convergence of the continued fraction expansion of a typical real number.
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.