Continued Fractions with Partial Quotients Bounded in Average

For any real number $x \in [0,1)$, we denote by $q_n(x)$ the denominator of the $n$-th convergent of the continued fraction expansion of $x$ $(n \in \mathbb{N})$. It is well-known that the Lebesgue measure of the set of points $x \in [0,1)$ for which $\log q_n(x)/n$ deviates away from $\pi^2/(12\log2)$ decays to zero as $n$ tends to infinity. In this paper, we study the rate of this decay by giving an upper bound and a lower bound. What is interesting is that the upper bound ...

Refining an estimate of Croot, Dobbs, Friedlander, Hetzel and Pappalardi, we show that for all $k \geq 2$, the number of integers $1 \leq a \leq n$ such that the equation $a/n = 1/m_1 + \dotsc + 1/m_k$ has a solution in positive integers $m_1, \dotsc, m_k$ is bounded above by $n^{1 - 1/2^{k-2} + o(1)}$ as $n$ goes to infinity. The proof is elementary.

Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,...,d_{k}],$ with all partial quotients $d_1,d_2,...,d_{k}$ 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 ...

It is shown that there is a constant A and a density one subset S of the positive integers, such that for all q in S there is some 1<=p<q, (p, q)=1, so that p/q has all its partial quotients bounded by A.

In this paper, we study distributional properties of the sequence of partial quotients in the continued fraction expansion of fractions $a/N$, where $N$ is fixed and $a$ runs through the set of mod $N$ residue classes which are coprime with $N$. Our methods cover statistics such as the sum of partial quotients, the maximal partial quotient, the empirical distribution of partial quotients, Dedekind sums, and much more. We prove a sharp concentration inequality for the sum of p...

Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum of partial quotients

We prove that a subset $A\subseteq [1, N]$ with \[\sum_{n\in A}\frac{1}{n} \ge (\log N)^{4/5 + o(1)}\] contains a subset $B$ such that \[\sum_{n\in B} \frac{1}{n} = 1.\] Our techniques refine those of Croot and of Bloom. Using our refinements, we additionally consider a number of questions regarding unit fractions due to Erd\H{o}s and Graham.

It is shown that there is an absolute constant $C$ such that any rational $\frac bq\in]0, 1[, (b, q)=1$, admits a representation as a finite sum $\frac bq=\sum_\alpha\frac {b_\alpha}{q_\alpha}$ where $\sum_\alpha\sum_ia_i(\frac {b_\alpha}{q_\alpha})<C\log q$ and $\{a_i(x)\}$ denotes the sequence of partial quotients of $x$.

We answer several questions of P. Erdos and R. Graham by showing that for any rational number r > 0, there exist integers n1, n2, ..., nk, k variable, where N < n1 < n2 < ... < nk < (e^r + o_r(1) ) N, such that r = 1/n1 + 1/n2 + ... + 1/nk. Moreover, we obtain the best-possible error term for the o_r(1), which is O_r(loglog N/log N).

We prove in particular that for any sufficiently large prime $p$ there is $1\le a<p$ such that all partial quotients of $a/p$ are bounded by $O(\log p/\log \log p)$. For composite denominators a similar result is obtained. This improves the well--known Korobov bound concerning Zaremba's conjecture from the theory of continued fractions.