Abstract
In the 1990s, J.C. Tong gave a sharp upper bound on the minimum of k consecutive approximation constants for the nearest integer continued fractions. We generalize this to the case of approximation by Rosen continued fraction expansions. The Rosen fractions are an infinite set of continued fraction algo- rithms, each giving expansions of real numbers in terms of certain algebraic integers. For each, we give a best possible upper bound for the minimum in appropriate consecutive blocks of approxima- tion coecients. We also obtain metrical results for large blocks of bad approximations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.