Conjecture on the large-length variance of left truncations

From papers

For a base b2b\geq 2 and a positive integer \ell, let TrunbL\mathrm{Trun}^L_b denote the number of left truncations and let Varb(TrunbL)\mathrm{Var}_{b^\ell}(\mathrm{Trun}^L_b) be its variance over integers below bb^\ell. Variance conjecture. As \ell\to\infty, we expect

Varb(TrunbL)=1log2b(11b)2(bϕ(b)1)log2+Ob(log).\mathrm{Var}_{b^\ell}(\mathrm{Trun}^L_b)=\frac{1}{\log^2 b}\left(1-\frac{1}{b}\right)^2\left(\frac{b}{\phi(b)}-1\right)\log^2\ell+O_b(\log\ell).

The conjecture concerns the large-\ell regime, where estimating the variance requires information about primes in arithmetic progressions with large moduli. The source presents heuristic evidence but no proof.

Progress summary

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

Sources & referencesView supporting material

Primary source

Vivian Kuperberg and Matilde Lalín, “Distributions of left prime truncations”, arXiv:2603.08451 (2026).

Solutions 0

No solutions have been posted yet.