Additional congruence conditions on the number of terms in sums of consecutive squared integers equal to squared integers

preprint2014arXivOpen access

Abstract

The problem of finding all the integer solutions in aa, MM and ss of sums of MM consecutive integer squares starting at a2≥1a^{2}\geq1 equal to squared integers s2s^{2}, has no solutions if M≡3,5,6,7,8M\equiv3,5,6,7,8 or 10(mod 12)10\left(mod\,12\right) and has integer solutions if M≡0,9,24M\equiv0,9,24% or %33\left(mod\,72\right); or M≡1,2M\equiv1,2 or 16(mod 24)16\left(mod\,24\right); or M≡11(mod 12)M\equiv11\left(mod\,12\right). In this paper, additional congruence conditions are demonstrated on the allowed values of MM that yield solutions to the problem by using Beeckmans' eight necessary conditions, refining further the possible values of MM for which the sums of MM consecutive integer squares equal integer squares.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.