Jump to content

Talk:Fibonacci matrix-exponentiation: Difference between revisions

m
(Fib(2^16) will be added)
Line 9:
The goal of the task is to show that the iterative method is slow to calculate large fibonacci numbers. Smaller values like fib(2^16) is easily found using the iterative method.
 
I think fib(2^32) is reachable using matrix exponentiation and even if it remains slow, Julia solution shows a fastestfaster method using Lucas sequence.
 
I confess fib(2^64) seems unreachable using matrix exponentiation. Nevertheless it allowed to see some creative solution like the Sidef solution using fibmod.
678

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.