The logarithm–rooted-tree degree asymptotic
Statement
Let be a prime, let be the rooted tree corresponding to , and let denote its degree, namely the number of nodes in . The logarithm of is compared with this degree by
Logarithm–rooted-tree degree conjecture. The degree of the rooted tree associated with a prime is asymptotic to . This is proposed as a natural measure on the linearized rational numbers related to the measure 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.