Power-law growth conjecture for Pratt-tree avoiding prime sets

For each prime rr, let Pr\mathcal{P}_r be the corresponding set of primes avoiding rr in their Pratt trees, and let

P(x)=#{pPr:px}.P(x)=\#\{p\in\mathcal{P}_r:p\leqslant x\}.

Growth conjecture for Pr\mathcal{P}_r. For each rr, there is a number δr>0\delta_r>0 such that

P(x)=x1δr+o(1)as x.P(x)=x^{1-\delta_r+o(1)}\quad\text{as }x\to\infty.

This is an educated guess based partly on computations for P3\mathcal{P}_3; the paper gives no heuristic establishing the asserted exponent, and the conjecture remains open.

Sources & referencesView supporting material

Primary source

Kevin Ford, “Sieving by very thin sets of primes, and Pratt trees with missing primes”, arXiv:1212.3498 (2013).

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.