Hurwitz's theorem (number theory)
From Infogalactic: the planetary knowledge core
<templatestyles src="Module:Hatnote/styles.css"></templatestyles>
In number theory, Hurwitz's theorem, named after Adolf Hurwitz, gives a bound on a Diophantine approximation. The theorem states that for every irrational number ξ there are infinitely many relatively prime integers m, n such that
The hypothesis that ξ is irrational cannot be omitted. Moreover the constant Failed to parse (Missing <code>texvc</code> executable. Please see math/README to configure.): \scriptstyle \sqrt{5}
is the best possible; if we replace Failed to parse (Missing <code>texvc</code> executable. Please see math/README to configure.): \scriptstyle \sqrt{5} by any number Failed to parse (Missing <code>texvc</code> executable. Please see math/README to configure.): \scriptstyle A > \sqrt{5} and we let Failed to parse (Missing <code>texvc</code> executable. Please see math/README to configure.): \scriptstyle \xi=(1+\sqrt{5})/2 (the golden ratio) then there exist only finitely many relatively prime integers m, n such that the formula above holds.
References
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.