Hacker Times
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
mappu
on Oct 4, 2011
|
parent
|
context
|
favorite
| on:
Node-fib: Fast non-blocking fibonacci server
By using a field extension over √5, you can evaluate this exactly without rounding or resorting to floating point.
euyyn
on Oct 5, 2011
[–]
I think that's a very sharp observation. I tried it, but in order to exponentiate the vectors (instead of floating point numbers) I end up with the original matrix algorithm (pre-eigenvalues)...
Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
