You are viewing a single comment's thread. Return to all comments →
Assume the function f(k) calculates the k-th Fibonacci number. If we know f(k) and f(k+1), then we can find:
f(2k) = f(k) * (2*f(k+1) - f(k))
f(2k + 1) = (f(n))^2 + (f(n+1))^2
Reference: https://www.nayuki.io/page/fast-fibonacci-algorithms
Is Fibo
You are viewing a single comment's thread. Return to all comments →
Assume the function f(k) calculates the k-th Fibonacci number. If we know f(k) and f(k+1), then we can find:
f(2k) = f(k) * (2*f(k+1) - f(k))
f(2k + 1) = (f(n))^2 + (f(n+1))^2
Reference: https://www.nayuki.io/page/fast-fibonacci-algorithms