Numbers which are not the sum of distinct squares: Difference between revisions
Content added Content deleted
m (→{{header|Phix}}: added comment: actually, 2*n+1 works too) |
m (→{{header|Phix}}: maybe 2*n+3) |
||
Line 62: | Line 62: | ||
subsequent holes, since it is longer than and overlaps the 2*n+1 gap between squares, at least that's my thinking... |
subsequent holes, since it is longer than and overlaps the 2*n+1 gap between squares, at least that's my thinking... |
||
Actually, a 2*n+1 block should be enough, and that works fine too. |
Actually, a 2*n+1 (or maybe 2*n+3) block should be enough, and that works fine too. |
||
You can run this online [http://phix.x10.mx/p2js/nsods.htm here]. |
You can run this online [http://phix.x10.mx/p2js/nsods.htm here]. |
||
<!--<lang Phix>(phixonline)--> |
<!--<lang Phix>(phixonline)--> |