Find all integers 1<=k<=169 for which 169 is not the sum of k nonzero squares.
The squares are not necessarily unique. For example k=5: 169=1+4+4+16+144.
This should be done without a brute force program.
(In reply to re(3): No Subject
I think that "This should be done without a brute force program"
also applies to doing it by hand in a brute-force manner. I could be
wrong, but I think that Brian had a method in mind where you didn't
have to specifically check every number from 1 to 169.
Posted by Sam
on 2004-11-05 06:21:58