Conjecture. It is well known that every number x \in (0, 1) admits a continued fraction expansion: 1 x = [a1 , a2 , \cdot \cdot \cdot ] := a1 + 1 ..
Statement
Conjecture. It is well known that every number x \in (0, 1) admits a continued fraction expansion: 1 x = [a1 , a2 , \cdot \cdot \cdot ] := a1 + 1 .. a2 + . The integers a1 , a2 , \cdot \cdot \cdot are called partial quotients for x. If x is rational, the length of the expansion is finite. Motivated by constructing sets with minimal discrepancy for numeric integra- tion, Zaremba was looking for rationals b/d with d arbitrarily large and yet all partial quotients of b/d are controlled. This led him to make the following conjec- ture: Conjecture 1 (Zaremba, 1972, [1]). Every natural number is the denominator of a reduced fraction whose partial fractions are bounded. That is, there exists some A > 1 so that for each d \in N, there is some b \in N with (b, d) = 1, so that b/d = [a1 , \cdot \cdot \cdot , ak ] with max{ai }ki=1 \leq A. In 2014, Bourgain and Kontorovich made a major breakthrough towards Zaremba’s conjecture: Theorem 2 (Bourgain-Kontorovich, 2014, [2]). Almost every number is the de- nominator of a reduced fraction whose partial quotients are bounded by 50. Note that a reduced fraction b/d admits an expansion b/d = [a1 , a2 , \cdot \cdot \cdot , ak ] if and only if ∗ b 0 1 0 1 0 1 = \cdot\cdot\cdot . ∗ d 1 a1 1 a2 1 ak 0 1 If we let Γ be the semigroup generated by : 1 \leq a \leq 50 and v0 = (0, 1)t , 1 a then the statement of Theorem 2 can be rephrased as #{h\gamma(v0 ), v0 i : \gamma \in Γ} \cap [1, N ] = N + o(N ) as N \to \infty. Bourgain and Kontorovich’s work on Zaremba’s Conjecture Xin Zhang
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.