Talk:Fibonacci matrix-exponentiation

From Rosetta Code
Revision as of 00:03, 13 February 2020 by rosettacode>DavidFashion (→‎Clarify Task: new section)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Clarify Task

The task to implement fib(n) using matrix multiplication is a great task. However, given that fib(2^32) has hundreds of million of digits, the task is unachievable. Many implementations use fibMod for the last digits, and another methodology for the first digits. Recommend a selecting smaller values of n, and sticking to the task of fib(n) using matrix multiplication, not fibMod or other implementations.

Retrieved from "https://rosettacode.org/wiki/Talk:Fibonacci_matrix-exponentiation?oldid=298177"