ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For i≥0i\geq 0 and q>0q>0, let siS(q)s_i^S(q) be the number of sets of i+1i+1 distinct integer squares greater than one whose sum is below qq, and let siC(q)s_i^C(q) be the number of sets of i+1i+1 distinct positive integer cubes greater than one whose sum is below qq. Let AiA_i and BiB_i satisfy

1=A0>A1>⋯>0,1=B0>B1>⋯>0.1=A_0>A_1>\dots>0,\qquad 1=B_0>B_1>\dots>0.

The square-and-cube sum-counting conjecture. The asymptotics are

siS(q)∼(Aiq)i+12,s_i^S(q)\sim (A_iq)^{\frac{i+1}{2}},

and

siC(q)∼(Biq)i+13.s_i^C(q)\sim (B_iq)^{\frac{i+1}{3}}.

The paper says that the cases i=0i=0 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 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.