arXiv · 2310.11279
Zaremba's Conjecture for Geometric Sequences: An Algorithm
Abstract
Even though Zaremba's conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy the strong version of the conjecture, all of which were obtained using essentially the same algorithm. In this note, we provide a refined algorithm using the folding lemma for continued fractions, which both generalizes and improves on the old one. As a result, we uncover new examples that fulfill the strong version of Zaremba's conjecture.
Explore related subjects
Keep this discovery
Elias Dubno. 2023-10-17. Zaremba's Conjecture for Geometric Sequences: An Algorithm. https://doi.org/10.1080/00029890.2024.2323902
Cite the original work for its findings. Save a collection to share your selection of sources.