Talk:Fibonacci matrix-exponentiation: Difference between revisions
Content added Content deleted
(→Clarify Task: new section) |
|||
Line 2: | Line 2: | ||
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. |
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. |
||
--[[User:DavidFashion|DavidFashion]] ([[User talk:DavidFashion|talk]]) 00:04, 13 February 2020 (UTC) |
Revision as of 00:04, 13 February 2020
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.
--DavidFashion (talk) 00:04, 13 February 2020 (UTC)