Ralf Stephan on Fri, 08 Jan 2016 09:29:13 +0100


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: fibonacci(n) for large n's

You're sure you want the complete number as result, or only modulo something, like in some Project Euler puzzles?

On Fri, Jan 8, 2016 at 9:03 AM Zak Seidov <zakseidov@yahoo.com> wrote:

Dear pari gurus,
what is the fastest way to calculate fibonacci numbers
other than just fibonacci(n) for large n's (>~10^10, say).
Thx,
Zak






















9n
0 for large