Difference between revisions of "Talk:Broken Eggs POW"

Revision as of 13:58, 16 January 2009

this problem is trivial to a number theorist, straight-forward to anyone who uses (or has studied) modulo arithmetic, and a bit challenging to anyone else unless they do it by trial and error.The general solution of course is 301+420n for n= 0, 1, 2, . . . of which the smallest is 301. cheers tpm