English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The problem of finding all the integer solutions in $a$, $M$ and $s$ of sumsof $M$ consecutive integer squares starting at $a^{2}\geq1$ equal to squaredintegers $s^{2}$, has no solutions if $M\equiv3,5,6,7,8$ or$10\left(mod\,12\right)$ and has integer solutions if $M\equiv0,9,24% or%33\left(mod\,72\right)$; or $M\equiv1,2$ or $16\left(mod\,24\right)$; or$M\equiv11\left(mod\,12\right)$. In this paper, additional congruenceconditions are demonstrated on the allowed values of $M$ that yield solutionsto the problem by using Beeckmans' eight necessary conditions, refining furtherthe possible values of $M$ for which the sums of $M$ consecutive integersquares equal integer squares.

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