Fibonacci matrix-exponentiation: Difference between revisions
Content added Content deleted
(Created page with "{{draft task|Matrix}}Category:Mathematics The '''Fibonacci sequence''' defined with matrix-exponentiation: <big><big> F<sub>0</s...") |
No edit summary |
||
Line 1: | Line 1: | ||
{{draft task| |
{{draft task|Matrices}}[[Category:Mathematics]] |
||
The '''Fibonacci sequence''' defined with [[wp:Fibonacci_number#Matrix_form|matrix-exponentiation]]: |
The '''Fibonacci sequence''' defined with [[wp:Fibonacci_number#Matrix_form|matrix-exponentiation]]: |
||
<big><big> F<sub>0</sub> = 0 </big></big> |
<big><big> F<sub>0</sub> = 0 </big></big> |
Revision as of 21:53, 30 January 2020
Fibonacci matrix-exponentiation is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
The Fibonacci sequence defined with matrix-exponentiation:
F0 = 0 F1 = 1
- Task
Write a function using matrix-exponentiation to generate Fibonacci number for n = 232 and n = 264.
Display only the 20 first digits and 20 last digits of each Fibonacci number.
- Extra
Generate the same Fibonacci numbers using Binet's formula below or another method.
- Related tasks