An inverse Fibonacci algorithm?
Since OP has asked about matrix solution not involving any floating point computations, here it is. We can achieve O(logn) complexity this way, assuming numeric operations have O(1) complexity. Let’s take 2×2 matrix A having following structure 1 1 1 0 Now consider vector (8, 5), storing two consecutive fibonacci numbers. If you multiply it … Read more