Skip to content
Better HN
Top
Best
Ask
Show
New
Jobs
Search
⌘K
0 points
WJW
6y ago
0 comments
Save
Share
The Fibonacci series grows so fast that for "large" values of N you'll need a arbitrary size integer implementation anyway, so at that point you might as well go for a (non-IEEE) arbitrary size float type and get all the significant digits you need.
0 comments
1 comments · 1 top-level
top
newest
oldest
nimithryn
6y ago
You’ll still need to compute the digits of Phi though, and then exponentiate that. My intuition is that using ints is still faster.
j
/
k
navigate · click thread line to collapse