ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime, let tpt_p be the rooted tree corresponding to pp, and let deg(tp)deg(t_p) denote its degree, namely the number of nodes in tpt_p. The logarithm of pp is compared with this degree by

ln⁡(p)∼deg(tp).\ln(p) \sim deg(t_p).

Logarithm–rooted-tree degree conjecture. The degree of the rooted tree associated with a prime pp is asymptotic to ln⁡(p)\ln(p). This is proposed as a natural measure on the linearized rational numbers related to the measure ln⁡(p) dp\ln(p)\,dp used in the discussion of the prime number theorem. The source provides no resolution or further conditions for this asymptotic claim.

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.