ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a base b≥2b\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 bℓb^\ell. Variance conjecture. As ℓ→∞\ell\to\infty, we expect

Varbℓ(TrunbL)=1log⁡2b(1−1b)2(bϕ(b)−1)log⁡2ℓ+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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.