On a Theorem of Legendre on Diophantine Approximation
Jaroslav Han\v{c}l, Tho Phuoc Nguyen

TL;DR
This paper refines Legendre's theorem on Diophantine approximation, improving bounds on irreducible fractions close to a real number, building upon previous enhancements by Barbolosi and Jager.
Contribution
It provides a sharper version of Legendre's theorem, extending the bounds for when fractions approximate real numbers, advancing the understanding of Diophantine approximation.
Findings
Refined bounds for irreducible fractions approximating real numbers
Improved theorems over previous results by Barbolosi and Jager
Enhanced criteria for convergents in Diophantine approximation
Abstract
Legendre's theorem states that every irreducible fraction which satisfies the inequality is convergent to . Later Barbolosi and Jager improved this theorem. In this paper we refine these results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Advanced Mathematical Theories and Applications · Advanced Mathematical Identities
