MathDB
sum of perfect squares in k different ways

Source: 2007 Estonia Open Olympiad Junior p10

March 27, 2020
combinatoricsSumnumber theoryPerfect Square

Problem Statement

Prove that for every integer kk, there exists a integer nn which can be expressed in at least kk different ways as the sum of a number of squares of integers (regardless of the order of additions) where the additions are all in different pairs.