🔢 mathematics

On Diophantine triples containing a triangular number

This paper presents a general construction that generates infinitely many families of $D(m^2)$ -triples consisting of triangular numbers, with each triple in these families sharing a common triangular number $T_n$ .

Original authors: Marija Bliznac Trebješanin

Published 2026-06-19

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Marija Bliznac Trebješanin

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 master builder working with a very special set of Lego bricks. These aren't just any bricks; they are Triangular Numbers. You know them as the counts of dots needed to build perfect triangles: 1 dot, 3 dots (a triangle of 2 rows), 6 dots (3 rows), 10 dots (4 rows), and so on.

The paper by Marija Bliznac Trebješanin is about finding a very specific, magical way to stack these triangular bricks together.

The Goal: The "Perfect Pair" Rule

In this mathematical world, there is a rule called a Diophantine Triple. Think of it like a compatibility test for your Lego bricks.

If you take any two different bricks from your set, multiply their sizes together, and then add a specific "magic number" (let's call it $m^2$ ), the result must be a Perfect Square (like 4, 9, 16, 25). If it is, those two bricks are "compatible."

The author wants to find groups of three triangular numbers that are all compatible with each other under this rule.

The Big Discovery

The paper claims to have found a factory (a mathematical construction) that can produce an infinite number of these special triplets.

Here is the most important part of the discovery:
No matter which triangular number you pick to start with (let's say you pick the 5th triangular number, which is 15), this factory can build an infinite number of triplets that all include your starting number.

It's as if you have a magic key (your starting number, $T_n$ ), and this factory can generate an endless supply of different "locks" (the other two numbers in the triplet) that fit perfectly with your key.

How the Factory Works (The Analogy)

The author doesn't just guess these numbers; she uses a recipe based on a repeating pattern, like a musical rhythm or a bouncing ball.

The Starting Step: She begins with two triangular numbers that already work well together.
The Bouncing Pattern: She uses a mathematical "bouncing" rule (called a recurrence relation) to calculate the next number. Imagine a ball bouncing on a trampoline. The height of the next bounce depends on the height of the previous two bounces.
The Infinite Chain: Because this bouncing rule never stops, she can keep generating new numbers forever. Each new number she generates creates a new, valid triplet with the original number she started with.

Why This Matters (In the Paper's Context)

Before this paper, we knew of some specific examples of these triplets. The author shows that these aren't just rare accidents. They are part of a massive, organized family.

The Guarantee: The paper proves that for any triangular number you choose, you can find infinitely many partners to form these special triplets.
The Flexibility: The "magic number" ( $m^2$ ) can be different for different families of triplets, but the method works for all of them.

A Small Caveat

The author adds a little "note" at the end. She says, "Hey, this factory makes many triplets, but it might not make every single possible triplet."

She gives examples where a triangular number is part of a valid triplet that this specific factory didn't produce. It's like saying, "My machine makes millions of red cars, but there might be a blue car out there that my machine didn't build." However, the main point stands: her machine proves that there are infinitely many red cars (triplets) for every starting point.

Summary

In simple terms: The author built a mathematical machine that proves you can take any triangular number and pair it with infinitely many other triangular numbers to create groups where the "multiply and add" rule always results in a perfect square. It turns a rare mathematical curiosity into an infinite, predictable pattern.

Technical Summary: On Diophantine Triples Containing a Triangular Number

Problem Statement
The paper addresses the problem of Diophantine $m$ -tuples, specifically sets of distinct positive integers where the product of any two distinct elements increased by a fixed integer $n$ yields a perfect square. The focus is on the variant where the elements of the set are restricted to triangular numbers ( $T_k = k(k+1)/2$ ) and the property parameter is a perfect square, $n = m^2$ .

While previous literature has established the existence of specific Diophantine triples of triangular numbers (e.g., $\{T_n, T_{n+4}, T_{4n^2+20n+8}\}$ ) and proven nonexistence results for larger sets (quintuples) in classical cases, this work investigates the density and construction of such triples. Specifically, it asks whether a fixed triangular number $T_n$ can be a member of infinitely many distinct $D(m^2)$ -triples consisting entirely of triangular numbers.

Methodology
The author employs a constructive approach based on recursive sequences and algebraic identities involving triangular numbers. The methodology proceeds as follows:

Initial Pair Construction: For a fixed positive integer $m$ and a starting index $n$ , the paper identifies a base $D(m^2)$ -pair $\{T_n, T_{n+4m}\}$ . The product of these elements plus $m^2$ is shown to be a perfect square, denoted $r_1^2$ .
Recursive Extension: The author defines a sequence of indices $N_k$ to generate new triangular numbers. Starting with $N_0 = n$ and $N_1 = n+4m$ , a third element $N_2 = 8r_1$ is constructed to form the initial triple $\{T_{N_0}, T_{N_1}, T_{N_2}\}$ .
Recurrence Relations: A recursive definition is established for subsequent indices:
$N_{k+2} = 8s_k + N_k$
where $s_k$ and $t_k$ are sequences of integers satisfying specific recurrence relations:
$s_{k+1} = 2s_k(2N_0 + 1) - s_{k-1}$
$t_{k+1} = 2s_k(2N_{k+1} + 1) + t_k$
The sequences $s_k$ and $t_k$ are derived from the condition that the product of pairs in the triple plus $m^2$ must be a square.
Explicit Formulas: The recurrence for $s_k$ is solved using characteristic roots $\alpha$ and $\beta$ (derived from $N_0$ ), yielding explicit closed-form expressions for $s_k$ , $N_k$ , and $t_k$ .
Verification: The proof relies on verifying that the newly constructed triple $\{T_{N_0}, T_{N_{k+1}}, T_{N_{k+2}}\}$ satisfies the $D(m^2)$ property. This involves algebraic simplification using the identity $T_{8x+y} = 32x^2 + 4x(2y+1) + T_y$ and the property $8T_n + 1 = (2n+1)^2$ . The author demonstrates that the required square conditions hold for all $k \geq 1$ .

Key Contributions and Results
The primary contribution is Theorem 1, which states:

Let $m$ be a positive integer. For every positive integer $n$ , the triangular number $T_n$ is a member of infinitely many $D(m^2)$ -triples of triangular numbers.

The paper provides a general construction that yields infinitely many families of such triples. Crucially, every triple generated by this construction contains the same initial triangular number $T_n$ . The construction is shown to be valid for any positive integers $m$ and $n$ .

Significance and Claims
The paper claims to establish the existence of an infinite family of $D(m^2)$ -triples of triangular numbers sharing a common element. This extends previous knowledge which had identified specific isolated triples or finite families.

The author notes modestly that the constructed triples are not necessarily the only such triples containing $T_n$ . The paper cites examples (such as $\{T_1, T_{15}, T_{90}\}$ ) where $T_n$ is the smallest element in a triple that does not arise from the specific recursive construction presented. However, the significance of the work lies in providing a systematic, general method to generate an infinite set of solutions for any given $T_n$ and $m^2$ , thereby demonstrating that triangular numbers are rich in Diophantine structure under the $D(m^2)$ property.