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. All Contests
  2. ProjectEuler+
  3. Project Euler #25: N-digit Fibonacci number
  4. Discussions

Project Euler #25: N-digit Fibonacci number

  • mdasif9a
     + 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)