The closed form solution works up to a point and then doesn't have enough precision. It's not especially efficient up to that point either. So it's either slow or wrong.
On Wed, Jan 15, 2014 at 1:40 PM, Shashwat Anand <[email protected]> wrote: > > > > On Thu, Jan 16, 2014 at 12:06 AM, Kevin Squire <[email protected]>wrote: > >> >> BTW, have anybody ever seen a recursion using Fib, that at the end >>> explicitly state that >>> we can get the nth term without closed form expression. >>> >> >> Do you mean "with" a closed form expression, such as with Binet's >> Formula[1]? >> > > But this closed form won't work in practice, right ? > The constraints of floating point arithmetic. > > >> >> Kevin >> >> >> [1] http://mathworld.wolfram.com/BinetsFibonacciNumberFormula.html >> > >
