Sums of three cubes¶
Integer representability by three signed cubes, subject to a modulo-nine obstruction.
Core Idea¶
The sum-of-three-cubes question fixes an integer k and asks whether three signed integer cubes add to it. A solution triple is an exact witness. Elementary modular arithmetic excludes k≡4 or 5 (mod 9), since each cube is 0 or ±1 modulo 9. For other residue classes, the modular filter alone neither produces a solution nor proves one must exist. The general characterization remains open.
Small targets can have obvious witnesses, while others demand enormous signed integers with cancellation. Booker's solution for 33 is a published computational discovery, not merely a reported approximation. Booker and Sutherland later found a solution for 42 by large-scale search. Each solved target adds knowledge about that integer while leaving the cross-target sufficiency question unresolved.
Structural Signature¶
Sig role-phrases:
- Target integer — The specified k is the value whose representability is in question. It is constitutive. Counterfactual: A question with no fixed target is a different search or universal conjecture.
- Three integer variables — Exactly three unrestricted signed integer inputs x, y, z are sought. It is constitutive. Counterfactual: Restricting variables to nonnegative integers changes the problem.
- Cubic-sum equation — The witness must satisfy x³+y³+z³=k exactly. It is constitutive. Counterfactual: Approximate numerical equality is not an integer solution.
- Modular obstruction — Residues 4 and 5 modulo 9 rule out solutions before search. It is diagnostic. Counterfactual: An allowed residue is not a proof that a solution exists.
- Verified witness or justified unknown — A positive answer supplies checked integers; absence after bounded search is not a no-solution proof. It is operating condition. Counterfactual: Large cancellation makes exact arithmetic important.
What It Is Not¶
- Not three nonnegative cubes. Signed values change representability.
- Not a decimal approximation. Exact integer equality is required.
- Not all admissible k solved. Passing the modulo-nine test is necessary, not sufficient as presently known.
- Not a universal proof from one witness. A triple settles its own k only.
- Closest near-miss. For an otherwise admissible target, a bounded computer search finds no triple; this negative result is a near-miss to an impossibility proof, because a witness may lie beyond the search bound.
Scope of Application¶
- Number theory. Analyze a Diophantine equation over integers.
- Modular reasoning. Exclude two residue classes before search.
- Computational mathematics. Find and verify large signed witnesses.
- Open-problem tracking. Distinguish known solutions from the unresolved universal question.
Clarity¶
Three signed integers must have cubes summing exactly to the chosen k. Targets congruent to 4 or 5 modulo 9 cannot work. Other residues are only eligible, not guaranteed. Booker's huge triple proves k=33 is representable but does not settle the general problem.
Manages Complexity¶
A tiny target may require enormous positive and negative cubes that almost cancel. Search strategies exploit arithmetic structure; exact integer verification is essential. A failed search within a bound is not an impossibility theorem, and the modular obstruction must not be promoted from a necessary condition into an unproved sufficiency claim.
Abstract Reasoning¶
- Fix the integer target k.
- Check k modulo 9 for the necessary obstruction.
- If eligible, search or construct signed integers x,y,z.
- Verify the cubic sum exactly.
- State whether the conclusion concerns one k, a family, or the unresolved general question.
Knowledge Transfer¶
Modular filtering and witness verification recur in Diophantine problems, but the exact three signed cubes and residues ⅘ mod 9 define this specific problem. Replacing cubes or the number of variables changes the mathematical identity.
Examples¶
Canonical¶
The equation has a small exact witness: 1³+1³+0³=2. Its residues are allowed modulo 9, and direct substitution proves representability for k=2. The same modular reasoning rules out k=4 or 5 modulo 9, but neither observation decides all other targets. This is a worked defining construction, not a computational search result.
Mapped back: Target integer → k=2; Three integer variables → x=1, y=1, z=0; Cubic-sum equation → 1+1+0=2 exactly; Modular obstruction → 2 is not a forbidden residue; Verified witness or justified unknown → direct integer substitution is a complete witness for this target.
Applied / In Practice¶
Booker's 2019 published search found integers 8866128975287528, -8778405442862239 and -2736111468807040 whose exact cubes sum to 33. This is a research use of the representability test for one long-unsolved admissible target; large cancellation requires exact verification and does not imply the full conjecture.
Mapped back: Target integer → k=33; Three integer variables → Booker's published signed triple; Cubic-sum equation → the three exact cubes sum to 33; Modular obstruction → 33 ≡ 6 mod 9, so it is not precluded; Verified witness or justified unknown → published exact solution settles this target only.
Structural Tensions¶
T1 — Cheap Obstruction versus Hard Positive Search. Modulo-nine arithmetic quickly proves some impossibilities but leaves most admissible targets undecided.
Diagnostic: Is a necessary condition being mistaken for a solution?
T2 — Large Search versus Proof Of Absence. Checking enormous finite bounds can find a witness yet failure to find one is not a general impossibility proof.
Diagnostic: What conclusion does the computation actually license?
T3 — Large Cancellation versus Exact Verification. Positive and negative cubes can nearly cancel, making approximate arithmetic unreliable for a tiny remainder.
Diagnostic: Has the identity been checked with integers?
Structural–Framed Character¶
This Diophantine problem is strongly structural: integer variables, cubic powers, equality and congruence have determinate truth conditions independent of institutional preferences. Evaluative weight: a witness is correct or incorrect under exact arithmetic; a search's elegance or computational expense is a separate assessment. Human-practice dependence: mathematicians choose to study this equation and historically choose which k to search, but the residue obstruction does not depend on that choice. Institutional origin: publication and volunteer computing shape discovery history, not what the equation means. Vocabulary travel: witness, admissibility and modular obstruction recur throughout mathematics; the exact three signed cubes and mod-nine residues do not transfer to different equations. Import versus recognition: another target k in the same equation is an instance; calling a three-squares or rational-cube problem the same thing imports only a partial analogy.
The verified portable skeleton includes the Constraint prime: the equation and variable domain restrict admissible triples, while modulo-nine arithmetic supplies a necessary impossibility test. Yet the named object is a specific representability question, not simply one constraint; no strict genus is forced. Its character: an exact mathematical existence problem with a distinctive arithmetic obstruction and open universal scope.
Structural Core vs. Domain Accent¶
This section identifies the equation's reusable reasoning without erasing its number-theoretic identity.
What is skeletal. A target, admissible variable set and equation allow a witness to prove one positive instance. A necessary congruence condition can exclude candidates before search. Constraint is the verified prime for the equality and modular restrictions, and the proof pattern—construct, test, then delimit inference—travels to many mathematical settings. A finite unsuccessful search, by contrast, is not a proof that the feasible set is empty.
What is domain-bound. Exactly three signed integer variables are cubed and summed. Cubes have residues 0 and ±1 modulo 9, excluding targets 4 or 5 modulo 9. The small 1³+1³+0³ witness and Booker's immense k=33 triple both satisfy that same exact equation. Replacing integer with rational, banning negatives or changing the exponent changes feasibility and invalidates the stated obstruction. The 2019 search history is evidence of difficulty, not part of the equation's truth condition.
Why this does not clear the prime bar. The portable concepts of constraint, witness and modular filter are already broad mathematical tools. This entry contributes a particular equation and unresolved characterization, not a new structure shown to travel literally beyond that equation. Calling it prime would either duplicate Constraint or promote a special number-theory problem into a universal template without cross-domain cases. It therefore remains domain-specific despite its formal precision.
Instantiates / Related Primes¶
This entry is a kind of Diophantine Equation.
-
Related prime: Optimization, not an asserted parent. Search algorithms may minimize cost, but representability asks whether an exact witness exists, not for a best feasible point under an objective.
-
Related prime: Constraint, not an asserted parent. The equation constrains variables, yet the named problem includes a specific arithmetic form and an existence question rather than being a generic constraint.
Relationships to Other Abstractions¶
Current abstraction Sums of three cubes Domain-specific
Parents (1) — more general patterns this builds on
-
Sums of three cubes is a kind of Diophantine Equation Domain-specific
Sums of three cubes asks for integer solutions to x3+y3+z^3=k, which is by definition a polynomial equation with integer coefficients requiring integer solutions.A Diophantine equation is a polynomial equation with integer coefficients whose admissible solutions must themselves be integers. The sum-of-three-cubes question fixes k and asks for integer x, y, z solving x3+y3+z^3=k, which is precisely this form, and its mod-9 obstruction (excluding k congruent to 4 or 5 mod 9) is a standard Diophantine solvability technique. Every instance of the problem is a Diophantine equation instance with a specific cubic form and modular obstruction, so removing the Diophantine framework removes the basis for both the modular exclusion and the search-for-integer-witnesses character of the open cases.
Hierarchy path (1) — routes to 1 parentless root
- Sums of three cubes → Diophantine Equation → Constraint
Neighborhood in Abstraction Space¶
Sums of three cubes sits in a moderately populated region (47th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Cryptographic & Combinatorial Hardness Problems (5 abstractions)
Nearest neighbors
- Numerical Method — 0.89
- Diffie–Hellman problem — 0.88
- Short Integer Solution Problem — 0.88
- Primitive Semiperfect Number — 0.86
- Minimal Axioms for Boolean Algebra — 0.85
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
- Three squares problem. Tell: Uses powers of two and different number-theoretic obstructions.
- Nonnegative cubes. Tell: Disallows cancellation and changes the feasible set.
- Rational cubes. Tell: Changes the coefficient domain and representability.
- Modulo-nine eligibility. Tell: Necessary filter, not a complete solution criterion.
References¶
- Andrew R. Booker, “Cracking the problem with 33”, Research in Number Theory 5 (2019): original three-cube formulation, modular framing and published exact k=33 witness in the Applied case.
- Andrew R. Booker and Andrew V. Sutherland, “On a question of Mordell”: original later search and exact representations including k=42; useful for distinguishing solved targets from the unresolved general question.
- Andrew V. Sutherland, Sums of cubes research page: author-maintained research context and source links. The elementary k=2 equality in the Canonical example is checked directly by integer arithmetic.