Not a sum of distinct squares
czp001 liuguangxi a_forsteri Burloq Min_25 C3PO Philippe_57721 gerrob zilet sinan hervas lesnik7 clytorock nielkh
Public  2м:3w  5xp  Programming  35.9% 
It is known since Lagrange that every positive integer can be represented as the sum of integer squares, 4 integers being enough.
But, if we add the constraint that all squares must be distinct, some integers are not representable as such a sum.
This set is finite.
How many positive integers can not be represented by a sum of distinct squares, and what is their sum? (You are given that the largest one if less than 5000)
Answer format: Count,Sum
[My timing: 15 s]
But, if we add the constraint that all squares must be distinct, some integers are not representable as such a sum.
This set is finite.
How many positive integers can not be represented by a sum of distinct squares, and what is their sum? (You are given that the largest one if less than 5000)
Answer format: Count,Sum
[My timing: 15 s]
New Members
 LzyRapx 3d:1h
 doc420836131 1w
 KennTedync 1w:3d
 CharlesUNSEM 2w:4d
 famx_pencil 2w:5d
Fresh Problems

Standard Nim 3d:15h
solved by 7 
Powerful Numbers II 4d:23h
solved by 8 
Powerful Numbers I 4d:23h
solved by 8 
Ordinal Numbers II 1w:4d
solved by 7 
Ordinal numbers I 1w:4d
solved by 8