Talk:Sequence of non-squares: Difference between revisions

Talk:Sequence of non-squares (view source)

44 bytes added , 7 years ago

added a section name to the first statement as a way to force the TOC to be in the proper place.

Anonymous user

Revision as of 08:53, 16 June 2011 (view source) Toucan (talk \| contribs) (→‎Ambiguity) ← Older edit		Latest revision as of 21:45, 27 January 2017 (view source) rosettacode>Gerard Schildberger (added a section name to the first statement as a way to force the TOC to be in the proper place.)
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)