Mathematics Atlas

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

Hurwitz's Theorem (Number Theory)

Number Theory

Hurwitz's theorem, named after Adolf Hurwitz, is a result in number theory giving a bound on how well an irrational number can be approximated by fractions. It states that for every irrational number there are infinitely many pairs of relatively prime integers m and n such that the irrational number differs from the fraction m over n by less than one divided by the square root of five times n squared, and that the constant square root of five is the best possible: for the golden ratio in particular, replacing that constant with any larger one leaves only finitely many such fractions. The theorem is equivalent to the statement that the Markov constant of every irrational number is at least the square root of five. 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
Existence Theorem 1
Statement Form
Inequality 1
Statement
For every irrational number xi there are infinitely many relatively prime integers m, n such that |xi - m/n| < 1/(sqrt(5) n^2), and the constant sqrt(5) is the best possible. 1
Connections

Has Statement Form

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.

Inequality, 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.

Sources
1. Hurwitz's theorem (number theory) (Wikipedia)
Introduction, first paragraph
Quote, Introduction, first paragraph
there are infinitely many relatively prime integers m, n such that
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.