Asymptotic enumeration conjecture for integer tetrahedra by perimeter
Statement
Let denote the number of integer tetrahedra of perimeter , counted up to congruence. Asymptotic enumeration conjecture. The number satisfies
This conjecture is motivated by computational data suggesting a power-law growth of degree five, but the numerical value of the denominator remains uncertain.
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.