Not a sum of distinct squares
Public  3w:1d  5xp  Programming  33.3% 
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
 Juliomox 2d:5h
 RandyHiz 1w:1d
 hamid914 1w:1d
 Richardtogue 1w:3d
 khlilism 1w:6d
Fresh Problems

Alternate sums 1d:4h
solved by 9 
Eulerconstant like 1d:4h
solved by 8 
Maximize XOR 1w:1d
solved by 9 
Mutated worm 1w:4d
solved by 6 
Self avoiding paths 2w:1d
solved by 10