Test if a number is fibonacci

by

A very nice test is that N is a Fibonacci number if and only if 5 N^2 + 4 or 5N^2 – 4 is a square number. For ideas on how to efficiently test that a number is square refer to the SO discussion.

Hope this helps

More Related Contents:

  1. Finding out nth fibonacci number for very large ‘n’
  2. An inverse Fibonacci algorithm?
  3. Custom Weighted Scale [closed]
  4. How to find nth prime with complexity o(1)
  5. Calculate distance between two latitude-longitude points? (Haversine formula)
  6. How to determine if a point is in a 2D triangle? [closed]
  7. Algorithm to find Largest prime factor of a number
  8. Is log(n!) = Θ(n·log(n))?
  9. nth fibonacci number in sublinear time
  10. How to calculate an angle from three points? [closed]
  11. Select k random elements from a list whose elements have weights
  12. How to make rounded percentages add up to 100%
  13. Writing your own square root function
  14. What is the fastest integer factorization algorithm?
  15. Computing set intersection in linear time?
  16. Modulus power of big numbers
  17. Why is the complexity of computing the Fibonacci series 2^n and not n^2?
  18. How to find the smallest number with just 0 and 1 which is divided by a given number?
  19. How to calculate the index (lexicographical order) when the combination is given
  20. Determining if two line segments intersect? [duplicate]
  21. How do I find a factorial? [closed]
  22. Fastest algorithm for circle shift N sized array for M position
  23. Strategies for simplifying math expressions
  24. How to express tetration function, for complex numbers
  25. What is the method for converting radians to degrees?
  26. Given Prime Number N, Compute the Next Prime?
  27. Find out which combinations of numbers in a set add up to a given total
  28. Why is my recursive function so slow in R?
  29. determine if a point sits inside an arbitrary shape?
  30. Location of highest density on a sphere

Leave a Comment