Project Euler #25: N-digit Fibonacci number

  • + 0 comments

    This Will Help You

    from math import log10, ceil, sqrt
    phi = (1+sqrt(5))/2 #phi is the golden ratio
    t = int(input())
    for a0 in range(t):
        d = int(input())
        term = ceil((log10(5)/2+d-1)/ log10(phi))
        print(term)