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

TL;DR
This paper refines Nathanson's 1974 theorem on Diophantine approximation, providing improved bounds for approximating irrationals with continued fractions having large elements.
Contribution
The paper improves Nathanson's original bounds on Diophantine approximation for irrationals with continued fractions.
Findings
Refined approximation bounds for irrationals with large continued fraction elements
Enhanced understanding of the relationship between continued fraction elements and approximation quality
Potential applications in number theory and Diophantine approximation
Abstract
In 1974, M. B. Nathanson proved that every irrational number represented by a simple continued fraction with infinitely many elements greater than or equal to is approximable by an infinite number of rational numbers satisfying . In this paper we refine this result.
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
TopicsAdvanced Mathematical Identities · Mathematical Dynamics and Fractals · Algebraic Geometry and Number Theory
