ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every integer xx one has x3≡0, 1,x^{3}\equiv 0,\,1, or −1(mod9)-1 \pmod 9, so no sum of three integer cubes is congruent to 44 or 55 modulo 99. For n∈Zn\in\mathbb{Z} put

R(n)={(x,y,z)∈Z3 : x3+y3+z3=n},R(n)=\{(x,y,z)\in\mathbb{Z}^{3}\ :\ x^{3}+y^{3}+z^{3}=n\},

where the variables range over all integers, positive, negative, or zero, and triples are counted as ordered.

Then for every integer nn with n≢4(mod9)n\not\equiv 4\pmod 9 and n≢5(mod9)n\not\equiv 5\pmod 9, the set R(n)R(n) is infinite; equivalently, for every such nn and every B>0B>0 there exists (x,y,z)∈R(n)(x,y,z)\in R(n) with max⁡(∣x∣,∣y∣,∣z∣)>B\max(|x|,|y|,|z|)>B.

Consequently, an integer nn is a sum of three integer cubes if and only if n≢±4(mod9)n\not\equiv\pm 4 \pmod 9.

Record

Added
Links

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.