🔢 mathematics

Nontrivial Solutions to a Cubic Identity and the Factorization of $n^2+n+1$

This paper provides a complete proof characterizing all integer solutions to a modified cubic identity by establishing their equivalence to specific structural conditions on the prime factorization of $n^2+n+1$ through the lens of Eisenstein integer norms and binary quadratic forms.

Original authors: Hajrudin Fejzić

Published 2026-02-20

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Hajrudin Fejzić

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a magical rulebook for numbers, specifically a famous one called Nicomachus's Identity. This rule says that if you take the first $n$ numbers (1, 2, 3...), cube them (multiply them by themselves three times), and add them up, the result is exactly the same as taking the sum of those numbers and squaring it.

It's like a perfect balance scale:
$1^3 + 2^3 + 3^3 + \dots + n^3 = (1 + 2 + 3 + \dots + n)^2$

The "What If?" Game

In this paper, mathematician Hajrudin Fejzić asks a playful "What if?" question. What if we break the perfect balance? What if we take one of those cubes out of the pile and swap it for a different cube?

The equation becomes:
$\text{(Sum of cubes)} + \text{New Cube} - \text{Old Cube} = (\text{Sum of numbers} + \text{New} - \text{Old})^2$

Usually, when you mess with a perfect mathematical equation, it breaks. But sometimes, it doesn't! Sometimes, there are "secret" numbers you can swap in that keep the equation true. These are called nontrivial solutions.

The paper's main goal is to answer: When do these secret swaps exist?

The Detective Work: The "Magic Number" $N$

Fejzić discovered that the answer depends entirely on a specific "Magic Number" derived from $n$ :
$N = n^2 + n + 1$

Think of $N$ as a lock. The equation only has a secret solution if this lock has a specific kind of keyhole.

The Keyhole Analogy: Prime Factors

To understand the keyhole, we need to look at the "ingredients" of $N$ . Every number is made of prime numbers (like 2, 3, 5, 7, 11, etc.), which are the building blocks of math.

The paper reveals a special rule about these building blocks:

The "3" Rule: The number 3 is a bit special. It can appear in $N$ , but only once.
The "1 mod 3" Rule: This is the crucial part. We are looking for prime numbers that leave a remainder of 1 when divided by 3 (like 7, 13, 19, 31...).

The Big Discovery:
The equation has a secret solution if and only if the Magic Number $N$ has at least two of these special "1 mod 3" prime ingredients.

Scenario A (No Solution): If $N$ is just a single prime (like 7) or three times a single prime (like 21), the lock is too simple. It's like trying to open a safe with only one tumbling pin; it won't work.
Scenario B (Solution Exists): If $N$ is a mix, like $7 \times 13$ or $7 \times 7$ , the lock has enough complexity to allow a secret solution.

The Secret Weapon: Eisenstein Integers

How did the author prove this? He didn't just count numbers; he traveled to a different mathematical universe called Eisenstein Integers.

Imagine the number line as a straight road. The author realized that to solve this puzzle, you need to step off the road and onto a hexagonal grid (like a honeycomb). In this hexagonal world, numbers aren't just $1, 2, 3$; they are combinations of $1$ and a special shape called $\omega$ (omega).

In this hexagonal world, the equation $a^2 + ab + b^2 = N$ represents the distance (or "norm") from the center of the grid to a specific point.

The author showed that finding a solution to the original cubic puzzle is the same as finding a specific point on this hexagonal grid that is exactly distance $N$ away from the center.
The "units" (the six directions you can spin in this hexagonal world) act like rotations. If you find one solution, you can spin it around to find five others.
The math proves that if $N$ has enough "1 mod 3" ingredients, the hexagonal grid has enough points at that distance to create a "non-trivial" solution (one that isn't just a boring, obvious swap).

The Takeaway

In simple terms, this paper connects a fun puzzle about adding cubes to the deep, hidden structure of prime numbers.

It tells us that mathematical beauty often hides in the complexity of prime factors. If your "Magic Number" ( $n^2+n+1$ ) is too simple (just one prime factor), the puzzle has no secret tricks. But if it's complex enough (two or more special prime factors), the universe of numbers opens up a hidden door, allowing a new, non-obvious solution to exist.

It's a reminder that even in a rigid system of rules, there is room for surprise, provided you look at the numbers through the right lens (in this case, a hexagonal one).

1. Problem Statement

The paper investigates a variation of Nicomachus's identity, a classical result stating that the sum of the first $n$ cubes equals the square of the sum of the first $n$ integers:
$\sum_{j=1}^n j^3 = \left( \sum_{j=1}^n j \right)^2$
The author studies the Diophantine equation formed by replacing one term in the cubic sum ( $k^3$ ) with a different cube ( $x^3$ ):
$\sum_{j=1}^n j^3 + x^3 - k^3 = \left( \sum_{j=1}^n j + x - k \right)^2$
The goal is to classify all integer solutions $(k, x, n)$ . While "trivial" solutions exist for all $n$ (e.g., $x=k$ or specific linear relations), the paper focuses on characterizing the existence of nontrivial solutions.

A previous 2005 study by other authors proposed a conjecture: nontrivial solutions exist if and only if $N = n^2 + n + 1$ is not a prime number and not three times a prime number. However, this characterization was stated without proof. This paper provides a rigorous proof of a stronger characterization and deduces the original conjecture as a corollary.

2. Methodology

The author employs a multi-step approach combining algebraic manipulation, the theory of binary quadratic forms, and the arithmetic of algebraic number fields.

A. Algebraic Reduction

The cubic identity is simplified through substitution. By setting $k = a - 1$ and $x = b + 1$ , the original cubic equation reduces to a quadratic Diophantine equation:
$a^2 + ab + b^2 = n^2 + n + 1$
Letting $N = n^2 + n + 1$ , the problem transforms into finding positive integer solutions $(a, b)$ to $a^2 + ab + b^2 = N$ that satisfy specific non-triviality constraints (specifically, excluding solutions where $\{a, b\} = \{n, 1\}$ or $a = b + 2$ ).

B. Arithmetic of Eisenstein Integers

The core of the methodology relies on the ring of Eisenstein integers, $\mathbb{Z}[\omega]$ , where $\omega = \frac{1 + \sqrt{-3}}{2}$ .

Norm Function: The quadratic form $a^2 + ab + b^2$ is identified as the norm function $N(z) = z\bar{z}$ for $z = a + b\omega \in \mathbb{Z}[\omega]$ .
Unique Factorization: Since $\mathbb{Z}[\omega]$ is a Euclidean Domain (and thus a Unique Factorization Domain), the author analyzes the prime factorization of $N$ within this ring.
Prime Classification: Rational primes $p$ $p$ behave differently in $\mathbb{Z}[\omega]$ $Z [ω]$ :
- $p \equiv 1 \pmod 3$ : Splits into two distinct conjugate primes ( $p = \rho\bar{\rho}$ ).
- $p \equiv 2 \pmod 3$ : Remains inert (prime in $\mathbb{Z}[\omega]$ ).
- $p = 3$ : Ramifies ( $3 = -\omega^2(1+\omega)^2$ ).

C. Counting Representations

Using the multiplicative property of the norm and the structure of units in $\mathbb{Z}[\omega]$ (the six roots of unity), the author derives the number of integer solutions to $a^2 + ab + b^2 = N$ .

If $N$ has prime factorization involving primes $p_i \equiv 1 \pmod 3$ with exponents $n_i$ , the total number of ordered integer solutions is $6 \prod (n_i + 1)$ .
The author proves a lemma stating that for $N$ (which is never a perfect square), each orbit of solutions under the action of the unit group contains exactly one solution with $a > 0$ and $b > 0$ .
Therefore, the number of positive solutions is $m = \prod (n_i + 1)$ .

3. Key Contributions and Results

Theorem 2 (Main Characterization)

The paper proves that nontrivial solutions to the modified cubic identity exist if and only if $N = n^2 + n + 1$ has at least two prime factors congruent to $1 \pmod 3$ , counted with multiplicity.

If $m = 2$ (only one such prime factor with exponent 1, or two distinct such primes), the only positive solutions are the trivial ones $(n, 1)$ and $(1, n)$ .
If $m \ge 3$ (implying at least two factors of type $p \equiv 1 \pmod 3$ ), at least one nontrivial positive solution exists.

Corollary 1 (Resolution of the 2005 Conjecture)

The paper proves the original conjecture from [1] as a direct consequence of Theorem 2 and a new Lemma 2:

Lemma 2: Any prime divisor $p$ of $n^2 + n + 1$ is either $3$ or $p \equiv 1 \pmod 3$ . Furthermore, if $3$ divides $N$ , it does so with exponent exactly 1.
Conclusion: $N$ has exactly one prime factor $\equiv 1 \pmod 3$ (counted with multiplicity) if and only if $N$ is a prime $p \equiv 1 \pmod 3$ , or $N = 3$ , or $N = 3p$ .
Therefore, nontrivial solutions exist if and only if $N$ is not a prime and not three times a prime.

4. Significance

Bridging Combinatorics and Number Theory: The paper establishes a surprising and rigorous link between a modified combinatorial identity (sums of cubes) and the arithmetic properties of algebraic number fields (Eisenstein integers).
Completing Previous Work: It provides the missing rigorous proof for a conjecture announced in 2005, elevating the result from a stated condition to a proven theorem.
Structural Insight: By utilizing the geometry of numbers (orbits under unit groups) and the specific factorization properties of $\mathbb{Z}[\omega]$ , the paper offers a deeper understanding of why certain quadratic forms represent specific integers in specific ways.
Generalizability: The methodology demonstrates how tools from algebraic number theory can be effectively applied to solve Diophantine equations arising from classical identities.

In summary, Fejzić successfully characterizes the existence of nontrivial solutions to a cubic identity by translating the problem into the language of norms in $\mathbb{Z}[\omega]$ , proving that the solvability depends entirely on the multiplicity of prime factors of $n^2+n+1$ that split in the Eisenstein integers.