Anonymous user
Talk:Sequence of non-squares: Difference between revisions
→Stability, Accuracy: Task Clarification
(→Stability, Accuracy: products can be completely eliminated; clarify task?) |
(→Stability, Accuracy: Task Clarification) |
||
Line 33:
::: Well, using that (k+1)^2 = k^2 + 2k + 1, you can even completely eliminate all multiplications. However the stated goal of the task (see top of discussion page) was "to show how easy it is to investigate functions in a programming language." So while this algorithm is certainly a solution of the task (well, printing out some values is missing) avoiding the numeric problems, I'm not sure if it isn't against the idea of the task. Maybe a clarification of the task would be a good idea. --[[User:Ce|Ce]] 07:36, 3 September 2008 (UTC)
:::: Try and implement something '''close to''' the given function that is being investigated, at least at first. --[[User:Paddy3118|Paddy3118]] 18:03, 3 September 2008 (UTC)
== Zero ==
| |||