Modified prime number theorem for the number trail

Let pkp_k be the kkth prime and define the number-trail prime-counting function by

π(N):=max{k:L(pk)N}.\pi_\infty(N):=\max\{k:L_\infty(p_k)\leq N\}.

Let c0c_0 be the constant defined by the limiting relation for L(N)/NL_\infty(N)/N, and let

Li(x)=2x1lnydy.\operatorname{Li}(x)=\int_2^x\frac{1}{\ln y}\,dy.

Modified prime number theorem.

limNπ(N)N/logN=limNπ(N)Li(N)=1c00.436992.\lim_{N\to\infty}\frac{\pi_\infty(N)}{N/\log N} =\lim_{N\to\infty}\frac{\pi_\infty(N)}{\operatorname{Li}(N)} =\frac{1}{c_0}\approx0.436992\ldots.

This conjecture predicts that counting primes along the number trail changes the usual prime-number asymptotic only by the scaling factor 1/c01/c_0; it is conditional in the surrounding discussion on the existence of the limiting constant and is not resolved in the source.

Sources & referencesView supporting material

Primary source

István Kolossváry and István Kolossváry, “The Prime Grid. Introducing a geometric representation of natural numbers”, arXiv:1711.02903 (2017).

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.