Node-fib: Fast non-blocking fibonacci server
I wonder why I don't often see folks directly computing Fib(n) using the equation given in SICP exercise 1.13:Fib(n) = round(φ^n / sqrt(5)), where φ = (1 + sqrt(5)) / 2.Cites:http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-11.html...https://secure.wikimedia.org/wikipedia/en/wiki/Fibonacci_num...