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:<p>Fib(n) = round(φ^n / sqrt(5)), where φ = (1 + sqrt(5)) / 2.<p>Cites:<p><a href="http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-11.html#%_thm_1.13" rel="nofollow">http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-11.html...</a><p><a href="https://secure.wikimedia.org/wikipedia/en/wiki/Fibonacci_number#Relation_to_the_golden_ratio" rel="nofollow">https://secure.wikimedia.org/wikipedia/en/wiki/Fibonacci_num...</a>