Anonymous user
Talk:Sequence of non-squares: Difference between revisions
→algorithm: new section
(→bc problem: fixed by why needing fixing?!) |
(→algorithm: new section) |
||
Line 52:
: Back on my steps: the assertion exists to check the validity of the formula upto 10^6, or to check the validity of the implementations (because of precision) upto 10^6? I think the formula has no such limit; so the check is there because of limits that bc, by design, has not... so to bc makes not too much sense the "assertion" part. Anyway, it is there now, if I've got it right this time! --[[User:ShinTakezou|ShinTakezou]] 13:27, 5 March 2009 (UTC)
== algorithm ==
Is there a reason that the task states (and most people implement) <tt>floor(1/2 + ...)</tt> instead of simply <tt>round(...)</tt>?
[[User:Sgeier|Sgeier]] 20:18, 28 September 2009 (UTC)
| |||