Primitive Representations of Integers by $x^3+y^3+2z^3$
Samir Siksek

TL;DR
This paper investigates the primitive representation of integers by the form x^3 + y^3 + 2z^3 and demonstrates that not all integers can be primitively represented, using cubic reciprocity to establish divisibility constraints.
Contribution
It provides a negative answer to the question of primitive representability for the form x^3 + y^3 + 2z^3, showing divisibility conditions for solutions.
Findings
Not all integers are primitively represented by x^3 + y^3 + 2z^3.
Solutions to x^3 + y^3 + 2z^3 = 8^m are divisible by 2^m.
Cubic reciprocity is used to derive divisibility constraints.
Abstract
A well-known open problem is to show that the cubic form represents all integers. An obvious variant of this problem is whether every integer can be {\em primitively} represented by . In other words, given an integer , are there coprime integers , , such that ? In this note we answer this variant question negatively. Indeed, we use cubic reciprocity to show that for every integral solution to ,the unknowns , , are divisible by .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Polynomial and algebraic computation · Mathematics and Applications
