Timeline for Calculating Binet's formula for Fibonacci numbers with arbitrary precision

9 events

when toggle format	what		by	license	comment
Dec 31, 2012 at 19:54	history	tweeted			twitter.com/#!/StackCompSci/status/285836439063769088
Dec 6, 2012 at 1:53	vote	accept	vzn
Dec 6, 2012 at 1:53	vote	accept	vzn
Dec 6, 2012 at 1:53
Dec 4, 2012 at 16:00	comment	added	vzn		I think @adrianNs comment is closest to my interest. maybe am thinking of a scheme that carries/"remembers" the known uncertainty of all the terms & then gives the final result to the desired/specified uncertainty. or specifically a scheme that guarantees the "nth" (incl fractional) bit of the answer is correct for any "n" given prior to calculation. also if a larger "n" is desired than previously, an answer that builds on the prior result, sort of like a streaming algorithm.... ideally using some general scheme that would be applicable to other similar formulas....
Dec 4, 2012 at 8:56	answer	added	Hendrik Jan		timeline score: 4
Dec 4, 2012 at 8:42	comment	added	adrianN		What do you mean by 'no roundoff error'? If you use finite precision you will always have to do some rounding, but for large enough precision the rounding result will always be correct.
Dec 4, 2012 at 7:12	comment	added	Sasho Nikolov		anything wrong with keeping enough precision so that the roundoff error is <1/2 and then rounding to the nearest integer?
Dec 4, 2012 at 4:02	history	edited	Juho	CC BY-SA 3.0	edited body; edited title
Dec 4, 2012 at 3:33	history	asked	vzn	CC BY-SA 3.0