calculate the nearest fibonacci numbers for each element in array with O(n) with n being the size of input

answer3.py

from math import sqrt,log,ceil

def fibo(n):
    return int((((1+sqrt(5))**n)-((1-sqrt(5))**n))/((2**n)*sqrt(5)))

def nearestFibo(array):
    for k in array:
        larger_Nearest_Fibo = ceil( (log(sqrt(5)*k)) /(log((1+sqrt(5))/2)) )
        print(fibo(larger_Nearest_Fibo))

nearestFibo([75024,600000])  # output is 75025 and 832040