Created
October 26, 2013 21:46
-
-
Save cnocon/7174944 to your computer and use it in GitHub Desktop.
Non-Iterative, Non-Recursive Solution for Identifying Whether a Number is a Fibonacci Number
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def is_fibonacci?(i) | |
| n1 = (5*i**2 + 4)**0.5 | |
| n2 = (5*i**2 - 4)**0.5 | |
| n1 % 1 == 0 || n2 % 1 == 0 ? true : false | |
| end | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment