fbpx
Wikipedia

Hurwitz's theorem (number theory)

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 condition that ξ is irrational cannot be omitted. Moreover the constant is the best possible; if we replace by any number and we let (the golden ratio) then there exist only finitely many relatively prime integers m, n such that the formula above holds.

The theorem is equivalent to the claim that the Markov constant of every number is larger than .

References

  • Hurwitz, A. (1891). "Ueber die angenäherte Darstellung der Irrationalzahlen durch rationale Brüche" [On the approximate representation of irrational numbers by rational fractions]. Mathematische Annalen (in German). 39 (2): 279–284. doi:10.1007/BF01206656. JFM 23.0222.02. S2CID 119535189.
  • G. H. Hardy, Edward M. Wright, Roger Heath-Brown, Joseph Silverman, Andrew Wiles (2008). "Theorem 193". An introduction to the Theory of Numbers (6th ed.). Oxford science publications. p. 209. ISBN 978-0-19-921986-5.{{cite book}}: CS1 maint: multiple names: authors list (link)
  • LeVeque, William Judson (1956). "Topics in number theory". Addison-Wesley Publishing Co., Inc., Reading, Mass. MR 0080682. {{cite journal}}: Cite journal requires |journal= (help)
  • Ivan Niven (2013). Diophantine Approximations. Courier Corporation. ISBN 978-0486462677.

hurwitz, theorem, number, theory, this, article, includes, list, references, related, reading, external, links, sources, remain, unclear, because, lacks, inline, citations, please, help, improve, this, article, introducing, more, precise, citations, october, 2. This article includes a list of references related reading or external links but its sources remain unclear because it lacks inline citations Please help to improve this article by introducing more precise citations October 2022 Learn how and when to remove this template message This article is about a theorem in number theory For other uses see Hurwitz s theorem 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 3 there are infinitely many relatively prime integers m n such that 3 m n lt 1 5 n 2 displaystyle left xi frac m n right lt frac 1 sqrt 5 n 2 The condition that 3 is irrational cannot be omitted Moreover the constant 5 displaystyle sqrt 5 is the best possible if we replace 5 displaystyle sqrt 5 by any number A gt 5 displaystyle A gt sqrt 5 and we let 3 1 5 2 displaystyle 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 The theorem is equivalent to the claim that the Markov constant of every number is larger than 5 displaystyle sqrt 5 References EditHurwitz A 1891 Ueber die angenaherte Darstellung der Irrationalzahlen durch rationale Bruche On the approximate representation of irrational numbers by rational fractions Mathematische Annalen in German 39 2 279 284 doi 10 1007 BF01206656 JFM 23 0222 02 S2CID 119535189 G H Hardy Edward M Wright Roger Heath Brown Joseph Silverman Andrew Wiles 2008 Theorem 193 An introduction to the Theory of Numbers 6th ed Oxford science publications p 209 ISBN 978 0 19 921986 5 a href Template Cite book html title Template Cite book cite book a CS1 maint multiple names authors list link LeVeque William Judson 1956 Topics in number theory Addison Wesley Publishing Co Inc Reading Mass MR 0080682 a href Template Cite journal html title Template Cite journal cite journal a Cite journal requires journal help Ivan Niven 2013 Diophantine Approximations Courier Corporation ISBN 978 0486462677 Retrieved from https en wikipedia org w index php title Hurwitz 27s theorem number theory amp oldid 1116947319, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.