News for hackers. Stuff that matters.

A comment on Analytic Combinatorics – A Worked Example. Parent comment

Re:Analytic Combinatorics – A Worked Example by aleph_minus_one on Tuesday April 08, 2025 @04:35PM (#43626182)
> Is "closed form" here supposed to mean "closed form we can evaluate without needing arbitrary-precision arithmetic"?

You don't need arbitrary-precision arithmetic to evaluate Binet's formula - big integer arithmetic suffices (simply do your calculations in the ring Z[X]/(X^2-X-1) ).

[ Parent | on HN ]
Re:Analytic Combinatorics – A Worked Example by PollardsRho on Friday April 11, 2025 @06:09PM (#43659214)
At that point, you'd be better off just using a recursive algorithm like the one in GMP. You're swapping out arbitrary-length for arbitrary-precision.
[ Parent | on HN ]