On pairs of triangular numbers whose product is a perfect square and pairs of intervals of successive integers with equal sums of squares
Abstract
A number N is a triangular number if it can be written as N = t(t + 1)/2 for some nonnegative integer number t. A triangular number N is called square if it is a perfect square, that is, N = d2 for some integer number d. Square triangular numbers were characterized by Euler in 1778 and are in one-to-one correspondence with the so-called near-isosceles Pythagorean triples (k,k+1,l), where k2 + (k+1)2 = l2. A quadratic number is the product = (k,j) = k(k+1)(k+j)(k+j+1) for some nonnegative integer numbers k and j. By definition, it is the product of two triangular numbers and 4. Quadratic number and the corresponding pair (k,j) are called square if is a perfect square. Clearly, (k,j) is square if both triangular numbers k(k+1)/2 and (k+j)(k+j+1)/2 are perfect squares. Yet, there exist infinitely many other square quadratic numbers. We construct polynomials ji(k) of degree i with positive integer coefficients satisfying equations: k + j2 (k) + 1 = k [a k + … + a1 k + a0]2 +1 = (k+1) [b k + … + b1 k + b0]2 and k + j2+1(k) + 1 = k(k+1) [a k + … + a1 k + a0]2 + 1 = [b+1 k+1+b k + … + b1 k + b0]2 for some positive integer and some coefficients ai, bj, i=0, …, , j=0, …, +1. All the obtained pairs (k, ji(k)) are square. We conjecture that the products of square triangular numbers and pairs (k, ji(k)) cover all quadratic squares. Additionally, we identify pairs of intervals of successive integers with equal sums of squares.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.