We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Mathematics
  3. Fundamentals
  4. Is Fibo
  5. Discussions

Is Fibo

Sort 365 Discussions, By:

  • muhsen_kaamil
     + 0 comments

    Python 3 Binet's formula

    def IsFibo(n):
    return ('IsNotFibo', 'IsFibo')[any(filter(lambda x: x%1==0, (sqrt(5*n**2+4), sqrt(5*n**2-4))))]

  • shreyashkhairna1
     + 0 comments

    def isFibo(n):

    a=-1
b=1
c=0
temp=False
for i in range(1,10000000):

    c=a+b

    if(c>n):
        break
    if(c==n):
        temp=True
        break

    a=b
    b=c

if(temp==True):

    return "IsFibo"
else:
    return "IsNotFibo"

  • rounakmandal3000
     + 0 comments

    This is my code for the problem isFibo . We are supposed to create a function which would detect if a number is a fibonacci number or not and returns IsFibo if it is one and IsNotFibo otherwise. But for n >= 28657 which is a fibonacci number this test fails, as p and q are then coming negative. Can someone please say what is wrong with my code?

    string isFibo(long n) { if(n==0) return "IsFibo"; long long p=5*n*n-4; long long q=5*n*n+4; cout<

  • lehoangtuanbk
     + 0 comments

    Python solution. O(1) time complexity. 

    list_fibo_num = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733, 1134903170, 1836311903, 2971215073, 4807526976, 7778742049, 12586269025, 20365011074, 32951280099]
def isFibo(n):
    # Write your code here
    if(n in list_fibo_num ): 
        return "IsFibo"
    return 'IsNotFibo'

  • steven85
     + 0 comments

    Solution in Swift only storing the last two items in the array to calculate the new value

    func isFibo(n: Int) -> String {
    var nums = [0,1]
    while nums[1] < n {
        nums.swapAt(0, 1)
        nums[1] = nums.reduce(0, +)
    }
    
    return nums[1] == n ? "IsFibo" : "IsNotFibo"
}
Load more conversations