🔢 mathematics

On pairs of triangular numbers whose product is a perfect square and pairs of intervals of successive integers with equal sums of squares

This paper investigates square quadratic numbers defined as the product of two triangular numbers multiplied by four, constructing infinite families of such pairs via specific polynomials and conjecturing that these, along with products of square triangular numbers, encompass all such cases, while also identifying pairs of successive integer intervals with equal sums of squares.

Original authors: Vladimir Gurvich, Mariya Naumova

Published 2026-02-20

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Vladimir Gurvich, Mariya Naumova

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 are a detective trying to solve a mystery about numbers. Specifically, you are looking for two very special types of number patterns that seem unrelated at first glance, but the authors of this paper discovered they are actually secret twins.

Here is the story of their discovery, broken down into simple concepts.

1. The Two Main Characters

Character A: The "Triangular" Numbers
Imagine stacking cannonballs to build a pyramid.

1 ball is a triangle.
3 balls make a bigger triangle.
6 balls make an even bigger one.
These are Triangular Numbers.

Now, imagine you want to arrange these balls into a perfect square (like a chessboard). Most triangular numbers can't do this. But some special ones can. For example, the triangular number 36 (which is $1+2+...+8$ ) is also a perfect square ( $6 \times 6$ ).

The Old Mystery: In 1778, a genius named Euler figured out exactly which triangular numbers are also perfect squares.

Character B: The "Product" Mystery
The authors asked a new question: What if we take two different triangular numbers and multiply them together?
Usually, the result is messy. But sometimes, the product of two triangular numbers is a perfect square.

Example: If you take the triangular number for 8 and the triangular number for 49, their product is a perfect square.
The New Discovery: The authors found a massive, infinite family of these "magic pairs." They suspect this is the only family that exists (a big conjecture).

2. The Bridge: The "Square Quadratic" Numbers

To find these pairs, the authors invented a mathematical "machine." They created a set of formulas (polynomials) that act like a recipe.

You put in a number $k$ .
The machine spits out a matching number $j$ .
When you combine $k$ and $j$ in a specific way, the result is guaranteed to be a perfect square.

Think of it like a lock and key. Most numbers are just random keys that don't fit. But the authors found the specific "master keys" (their formulas) that always unlock the door to a perfect square. They proved that for every "size" of the problem, there is exactly one unique master key.

3. The Second Mystery: The "Equal Sum" Intervals

Now, let's switch scenes to a different puzzle. Imagine you have two groups of people standing in a line, holding numbers.

Group A holds a sequence of consecutive numbers (e.g., 10, 11, 12, 13).
Group B holds a different sequence of consecutive numbers (e.g., 20, 21, 22).

The puzzle is: Can you find two groups where the sum of the squares of their numbers is exactly the same?

Example: $10^2 + 11^2 + 12^2 = 13^2 + 14^2$ . (Both sides equal 365).

This is a very hard problem. Usually, the groups need to be very specific sizes and positions to make the math work out.

4. The Grand Connection

Here is the "Aha!" moment of the paper. The authors realized that the Master Keys from Character A (the triangular number pairs) are the exact same keys needed to solve Character B (the equal sum intervals).

The Analogy: Imagine you have a secret code (the triangular pairs). If you crack this code, it automatically tells you how to arrange the people in the line so their squared sums match perfectly.
The Specific Twist: They found that if the two groups of people differ in length by exactly one person (e.g., one group has 5 people, the other has 6), the solution is guaranteed to exist if you use their "Master Key" formulas.

5. The Big Guess (The Conjecture)

The authors are very confident, but they haven't proven it 100% yet. They are making a bold guess:

"We found all the 'Master Keys' that make triangular products perfect squares. We also found all the ways to make these special equal-sum intervals (where the lengths differ by 1). We believe there are no other solutions hiding in the universe of numbers."

They also proved that if their guess about the triangular numbers is true, then their guess about the intervals is automatically true, and vice-versa. They are two sides of the same coin.

Summary in a Nutshell

The Problem: Finding pairs of numbers that create perfect squares when multiplied, and finding groups of numbers that have equal sums of squares.
The Solution: The authors found a specific, infinite family of formulas that generate these solutions.
The Connection: These two seemingly different math problems are actually the same problem wearing different hats.
The Future: They suspect these are the only solutions that exist, turning a chaotic search for numbers into a neat, organized list.

It's like finding that the recipe for the world's best chocolate cake is exactly the same as the recipe for the world's best soufflé. Once you know the ingredients for one, you automatically know the ingredients for the other.

1. Problem Statement

The paper addresses two interconnected problems in number theory:

Square Quadratic Pairs: Identifying pairs of non-negative integers $(k, j)$ $(k, j)$ such that the product of two triangular numbers, $T_k = \frac{k(k+1)}{2}$ $T_{k} = \frac{k ( k + 1 )}{2}$ and $T_{k+j} = \frac{(k+j)(k+j+1)}{2}$ $T_{k + j} = \frac{( k + j ) ( k + j + 1 )}{2}$ , multiplied by 4, results in a perfect square. Specifically, the authors investigate when the "quadratic number" $\Pi(k, j) = k(k+1)(k+j)(k+j+1)$ $Π (k, j) = k (k + 1) (k + j) (k + j + 1)$ is a perfect square.
- Trivial Case: If both $T_k$ and $T_{k+j}$ are individually perfect squares (square triangular numbers), their product is obviously a square.
- Non-Trivial Case: The paper seeks pairs where the individual triangular numbers are not squares, yet their product (scaled by 4) is a square.
Equal Sums of Squares: Finding pairs of disjoint intervals of successive integers, $[n-m, n+k]$ and $[n+k+j+1, n+2k+j]$ , such that the sum of squares of the integers in the first interval equals the sum of squares in the second. The authors focus on the case where the lengths of the intervals differ by exactly 1 (i.e., $m=0$ ).

2. Methodology

The authors employ a combination of algebraic manipulation, polynomial construction, and recursive number theory techniques:

Polynomial Identities: The core methodology involves constructing families of polynomials $j_i(k)$ $j_{i} (k)$ of degree $i$ $i$ . The authors define these polynomials such that the identity $k + j_i(k) + 1$ $k + j_{i} (k) + 1$ can be expressed in two specific forms simultaneously:
- For even $i=2\ell$ : $k + j_{2\ell}(k) + 1 = k \cdot A(k)^2 + 1 = (k+1) \cdot B(k)^2$ .
- For odd $i=2\ell+1$ : $k + j_{2\ell+1}(k) + 1 = k(k+1) \cdot A(k)^2 + 1 = B(k)^2$ .
  Here, $A(k)$ and $B(k)$ are polynomials with positive integer coefficients. These identities ensure that $\Pi(k, j_i(k))$ is a perfect square for all integer $k$ .
Recursive Characterization: The authors utilize a "Fibonacci-like" sequence $x_i$ defined by $x_{i+2} = 2x_{i+1} + x_i$ (related to the Pell equation $x^2 - 2y^2 = 1$ ) to characterize square triangular numbers and near-isosceles Pythagorean triples.
Discriminant Analysis: For the interval problem, the authors transform the equality of sums of squares into a quadratic equation in $n$ . They analyze the discriminant $D$ of this equation, showing that $D$ is a perfect square if and only if $\Pi(k, j)$ is a perfect square (in the case $m=0$ ).
Computational Verification: The authors computed solutions for $k \le 8$ and $i \le 8$ to generate explicit examples and verify the uniqueness of their polynomial families. They also performed extensive searches for rational solutions in the general case ( $m > 0$ ) for $m, k \le 100$ .

3. Key Contributions and Results

A. Characterization of Square Quadratic Numbers

Infinite Families: The paper proves the existence of an infinite family of pairs $(k, j)$ where $\Pi(k, j)$ is a perfect square, generated by the polynomials $j_i(k)$ .
Explicit Formulas: The authors provide explicit formulas for the coefficients of the polynomials $A(k)$ $A (k)$ , $B(k)$ $B (k)$ , and the resulting $j_i(k)$ $j_{i} (k)$ for both even and odd degrees.
- Example ( $i=1$ ): $j_1(k) = k(4k+3)$ . Here, $\Pi(k, j_1) = [2k(k+1)(2k+1)]^2$ .
- Example ( $i=2$ ): $j_2(k) = 8k(k+1)(2k+1)$ .
Conjecture 1 & 2: The authors conjecture that all square pairs $(k, j)$ $(k, j)$ fall into one of two categories:
1. The pairs generated by the polynomial families $j_i(k)$ described above.
2. "Bi-Pythagorean" pairs where both $k$ and $k+j$ are square triangular numbers (or specific parity exceptions related to near-isosceles Pythagorean triples).
  They assert that no other "exceptional" pairs exist outside these families.

B. Intervals with Equal Sums of Squares

Equivalence: The paper establishes a direct equivalence between the problem of finding square quadratic numbers $\Pi(k, j)$ and finding pairs of intervals of successive integers with equal sums of squares where the interval lengths differ by 1 ( $m=0$ ).
Explicit Solutions: For every square quadratic pair $(k, j_i(k))$ $(k, j_{i} (k))$ , the authors derive two integer solutions for the starting point $n$ $n$ of the intervals.
- Formula: $n = k(k+j) \pm \sqrt{\Pi(k, j)}$ .
- This generates identities of the form:
  $\sum_{t=0}^{k} (n+t)^2 = \sum_{t=1}^{k} (n+j+1+t)^2$
General Case ( $m > 0$ ): The authors provide a discriminant formula for the general case where interval lengths differ by $m+1$ . They present a table of rational solutions for $m, k \le 100$ and $j \le 18$ , noting that integer solutions are rare and often correspond to the $m=0$ cases or specific small exceptions.

C. Connection to Classical Problems

Square Triangular Numbers: The work re-derives Euler's 1778 characterization of square triangular numbers using the sequence $x_i$ .
Near-Isosceles Pythagorean Triples: The solutions for $k=1$ correspond to near-isosceles Pythagorean triples $(n, n+1, n+j+2)$ , linking the problem to the ancient Plimpton 322 tablet.
Dostor's Identity: The case $j=m=0$ recovers Dostor's 1879 identity regarding the sum of squares of consecutive integers.

4. Significance

Unification of Number Theory Problems: The paper successfully unifies the study of square triangular numbers, Pythagorean triples, and sums of consecutive squares under the framework of "square quadratic numbers."
Structural Insight: By defining specific polynomial families, the authors provide a constructive method to generate infinite families of solutions to a Diophantine problem that is otherwise difficult to solve directly.
Conjectural Completeness: The paper moves beyond finding examples to proposing a conjecture that these families are complete. This suggests a deep structural limitation on how products of triangular numbers can form squares.
Algorithmic Generation: The explicit formulas allow for the algorithmic generation of large integers satisfying these complex sum-of-squares properties, which has implications for recreational mathematics and the study of Diophantine equations.

5. Conclusion

Gurvich and Naumova provide a comprehensive analysis of when the product of two triangular numbers is a perfect square. They demonstrate that this condition is equivalent to finding pairs of consecutive integer intervals with equal sums of squares (with length difference 1). Through rigorous algebraic construction and computational verification, they propose that all such solutions are generated by a specific set of polynomial identities or correspond to known square triangular number pairs, effectively characterizing the solution space for this class of problems.