Conjecture on the typical height of Pratt trees
Statement
For a prime , let be the height of its Pratt tree: the tree with root , whose children are the prime factors of , constructed recursively, stopping at . Let denote the number of primes at most . Pratt-tree height conjecture. There exist constants and real numbers such that
for all and ,
and
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.