Finding out nth fibonacci number for very large ‘n’

by

You can use the matrix exponentiation method (linear recurrence method).
You can find detailed explanation and procedure in this or this blog. Run time is O(log n).

I don’t think there is a better way of doing this.

More Related Contents:

  1. Test if a number is fibonacci
  2. An inverse Fibonacci algorithm?
  3. Custom Weighted Scale [closed]
  4. Sum a number with divisors to get another number
  5. How to create the most compact mapping n → isprime(n) up to a limit N?
  6. Mapping two integers to one, in a unique and deterministic way
  7. Least common multiple for 3 or more numbers
  8. Select k random elements from a list whose elements have weights
  9. Is it possible to express “t” variable from Cubic Bezier Curve equation?
  10. Choosing n numbers with fixed sum
  11. Need help in mod 1000000007 questions
  12. What is the fastest integer factorization algorithm?
  13. Check if one integer is an integer power of another
  14. Modulus power of big numbers
  15. Puzzle: Find largest rectangle (maximal rectangle problem)
  16. How can I calculate the age of a person in year, month, days?
  17. Why is the complexity of computing the Fibonacci series 2^n and not n^2?
  18. finding a^b^c^… mod m
  19. Determining if two line segments intersect? [duplicate]
  20. Fastest algorithm for circle shift N sized array for M position
  21. How do you find a point at a given perpendicular distance from a line?
  22. How to find distance from the latitude and longitude of two locations?
  23. Reverse complex 2D lookup table
  24. How do I determine whether my calculation of pi is accurate?
  25. JavaScript: Calculate the nth root of a number
  26. Given Prime Number N, Compute the Next Prime?
  27. Calculating phi(k) for 1
  28. Can a Fibonacci function be written to execute in O(1) time?
  29. Optimized low-accuracy approximation to `rootn(x, n)`
  30. How can I perform Collision Detection on rotated rectangles? [closed]

Leave a Comment