The Fibonacci numbers satisfy this pretty neat matrix identitypic.twitter.com/WosDUL8oW9
-
I'd seen it before as a fast way of computing large Fibonacci numbers. Suppose you want the 2^1000th Fibonacci number. You can get there quickly by squaring the matrix [1 1; 1 0], squaring the result, and so on 1000 times
-
-
Oh yeah! I seem to remember that computing large Fibonacci numbers from the closed-form expression requires arbitrary-precision floating point numbers
-
Huh.. Cool!
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.