The asymptotic counting conjecture for sums of distinct squares and cubes
Statement
For and , let be the number of sets of distinct integer squares greater than one whose sum is below , and let be the number of sets of distinct positive integer cubes greater than one whose sum is below . Let and satisfy
The square-and-cube sum-counting conjecture. The asymptotics are
and
The paper says that the cases follow from elementary considerations. The higher-dimensional asymptotics are motivated by the computational growth observed for sums of distinct squares and cubes.
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.