Anonymous user
Talk:Sequence of non-squares: Difference between revisions
added a section name to the first statement as a way to force the TOC to be in the proper place.
(→Ambiguity: Natural numbers. Too late for non-square checks.) |
(added a section name to the first statement as a way to force the TOC to be in the proper place.) |
||
| (One intermediate revision by one other user not shown) | |||
Line 1:
== chose a way to investigate functions ==
I chose this as a way to show how easy it is to investigate functions in a programming language. --[[User:Paddy3118|Paddy3118]] 08:42, 24 August 2008 (UTC)
== Stability, Accuracy ==
The formula need to be investigated for numeric stability. Calculation of sqrt is inexact, it need to be shown that for all n in question, floor(1/2 + sqrt(n)) yields the exact result. A minimal requirement for this (though insufficient, I guess) is that sqrt has an error below 0.5. Note that the addition following to squaring will normalize for big n. Also conversion of those to floating point becomes quickly inexact when 32-bit floats are used. --[[User:Dmitry-kazakov|Dmitry-kazakov]] 09:51, 24 August 2008 (UTC)
Line 81 ⟶ 83:
:::::::With over fifty examples, it is too late to mess around with the task goals, although I probably did miss the chance to ensure that the non-square naturals are represented up to a limit. --[[User:Paddy3118|Paddy3118]] 06:28, 16 June 2011 (UTC)
::::::::Ok, no problem ;-) [[User:Toucan|Toucan]] 08:53, 16 June 2011 (UTC)
| |||