ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let LkL_k be the sets of kk-Lehmer numbers, and define

Ck(x):=#{n∈Lk:n≤x}.C_k(x):=\#\{n\in L_k:n\leq x\}.

Asymptotic independence conjecture. For every k>1k>1, the asymptotic behavior of CkC_k does not depend on kk and, in particular,

Ck(x)∈O(xlog⁡log⁡x).C_k(x)\in\mathcal{O}\left(\frac{x}{\log\log x}\right).

The conjecture concerns the asymptotic density of the sets LkL_k and predicts a uniform order of growth for their counting functions, although no resolution is given in the source.

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.