Representation of positive integers by the form x3+y3+z3-3xyz
Abstract
We study the number (n) of representations of a positive integer n by the form x3+y3+z3-3xyz in the conditions 0≤ x≤ y≤ z; z≥ x+1. We proved the following results: (i) for every positive n, except for n3 9, (n)>=1; (ii) for the exceptional n, (n)=0; (iii) for every prime p≠3, (p)=(2p)=1; (iv) ((n))=∞; (v) for every positive n, there exists k such that (k)=n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.