Diophantine m-tuples of Triangular Numbers
A $m$-tuple with the property $D(n)$ is a tuple of $m$ positive integers $(a_1, a_2, \dots, a_m)$ such that $a_i a_j + n$ is an square, for $1 \le i < j \le m$. The $k$th triangular number is $T_k = \frac{k(k+1)}{2}$ for nonnegative integers $k$. We consider $D(1)$ tuples consisting only of triangular numbers. We prove the nonexistence of any $D(1)$ triangular quadruple and describe an algorithm to generate an infinite family of $D(1)$ triangular triples, which we conjecture contains all $D(1)$ triangular triples. We also consider general $D(n)$ tuples. To aid with computational difficulties, we present an efficient algorithm, using Generalized Pell Equations (GPEs), to determine whether $T_a$ is in a $D(n)$ triangular pair, which runs in $O(a^{1/2})$ time. We then prove that no $D(n)$ triangular pair exists for $n \equiv 2,5 \text{ (mod } 9\text{)}$, and discuss other values of $n$ for which there appear to be no $D(n)$ triangular pairs. We also show that our $D(n)$ equation has solutions in all $\mathbb{Q}_p$, for $p \neq 3$. We then present progress on determining a general criteria on $n$ for which no $D(n)$ triangular pairs exist.