On pairs of triangular numbers whose product is a perfect square and pairs of intervals of successive integers with equal sums of squares
Vladimir Gurvich, Mariya Naumova

TL;DR
This paper explores properties of triangular numbers, quadratic numbers, and their relationships to perfect squares, constructing polynomial solutions and conjecturing their completeness in covering all quadratic squares, while also examining equal sums of squares in integer intervals.
Contribution
It introduces polynomial constructions for pairs of integers related to square quadratic numbers and conjectures their comprehensive coverage of all such squares, also analyzing intervals with equal sums of squares.
Findings
Constructed polynomial solutions for square quadratic numbers.
Conjectured that these solutions cover all quadratic squares.
Identified pairs of successive integer intervals with equal sums of squares.
Abstract
A number is a triangular number if it can be written as for some nonnegative integer number . A triangular number is called square if it is a perfect square, that is, for some integer number . Square triangular numbers were characterized by Euler in 1778 and are in one-to-one correspondence with the so-called near-isosceles Pythagorean triples , where . A quadratic number is the product for some nonnegative integer numbers and . By definition, it is the product of two triangular numbers and 4. Quadratic number and the corresponding pair are called square if is a perfect square. Clearly, is square if both triangular numbers and are perfect squares. Yet, there exist infinitely many other square quadratic numbers. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
