The averaged Zaremba counting conjecture

For A2A\geq 2, let

EA={x=[0;a1,a2,][0,1]:ajA},E_A=\{x=[0;a_1,a_2,\ldots]\in[0,1]:a_j\leq A\},

and define

ΣN,A={aNEA:1a<N, (a,N)=1},\Sigma_{N,A}=\left\{\frac{a}{N}\in E_A:1\leq a<N,\ (a,N)=1\right\}, ΩN,A={anEA:1a<nN, (a,n)=1}.\Omega_{N,A}=\left\{\frac{a}{n}\in E_A:1\leq a<n\leq N,\ (a,n)=1\right\}.

The averaged Zaremba conjecture. For NNN\in\mathbb{N},

ΣN,AN2δAN=N2δA1.|\Sigma_{N,A}|\sim\frac{N^{2\delta_A}}{N}=N^{2\delta_A-1}.

Here δA\delta_A is the Hausdorff dimension of EAE_A, and fgf\sim g means f/g1f/g\to1 as the relevant variable tends to infinity. This interpretation is motivated by Hensley's observation that ΩN,AN2δA|\Omega_{N,A}|\sim N^{2\delta_A}; the supplied text does not specify whether the asserted asymptotic has been proved.

Sources & referencesView supporting material

Primary source

Jungwon Lee, “Asymptotic statistics for finite continued fractions with restricted digits”, arXiv:2512.11357 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.