Power-law growth conjecture for Pratt-tree avoiding prime sets
For each prime , let be the corresponding set of primes avoiding in their Pratt trees, and let
Growth conjecture for . For each , there is a number such that
This is an educated guess based partly on computations for ; the paper gives no heuristic establishing the asserted exponent, and the conjecture remains open.
References
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.