ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a prime pp, let H(p)H(p) be the height of its Pratt tree: the tree with root pp, whose children are the prime factors of p−1p-1, constructed recursively, stopping at p=2p=2. Let π(x)\pi(x) denote the number of primes at most xx. Pratt-tree height conjecture. There exist constants c,c′>0c,c'>0 and real numbers {E(p):p prime}\{E(p):p~\mathrm{prime}\} such that

H(p)=elog⁡p−32log⁡log⁡p+E(p),H(p)= e\log p - \frac{3}{2} \log\log p + E(p),

for all z⩾0z\geqslant 0 and x⩾0x\geqslant 0,

e−c′zπ(x)≪∣{primes p⩽x:E(p)⩾z}∣≪e−czπ(x),e^{-c' z} \pi(x) \ll |\{\mathrm{primes}~p \leqslant x: E(p) \geqslant z\}| \ll e^{-cz} \pi(x),

and

∣{primes p⩽x:E(p)⩽−z}∣≪exp⁡(−ecx)π(x).|\{\mathrm{primes}~p \leqslant x: E(p) \leqslant -z\}| \ll \exp(-e^{cx})\pi(x).

The conjecture describes the typical height of Pratt trees and is motivated by results supporting branching-random-walk heuristics; the source provides no resolution, so its status remains open.

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.