Numbers which are not the sum of distinct squares: Difference between revisions
Numbers which are not the sum of distinct squares (view source)
Revision as of 20:03, 24 November 2021
, 2 years ago→{{header|Phix}}: added comment: actually, 2*n+1 works too
m (→{{header|Phix}}: added comment: actually, 2*n+1 works too) |
|||
Line 61:
that is guaranteed to become at least twice that length in the next step, and it will (eventually) overwrite any
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.
You can run this online [http://phix.x10.mx/p2js/nsods.htm here].
<!--<lang Phix>(phixonline)-->
| |||