2000 character limit reached
A strengthening of a theorem of Bourgain-Kontorovich-III (1407.4054v1)
Published 15 Jul 2014 in math.NT
Abstract: Zaremba's conjecture (1971) states that every positive integer number can be represented as a denominator (continuant) of a finit continued fraction with all partial quotients being bounded by an absolute constant A. Recently (in 2011) several new theorems concerning this conjecture were proved by Bourgain and Kontorovich. The easiest of them states that the set of numbers satisfying Zaremba's conjecture with A = 50 has positive proportion in N. In 2014 the author with D. A. Frolenkov proved this result with A =5. In this paper the same theorem is proved with alphabet {1, 2, 3, 4, 10}
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.