Skip to content

Instantly share code, notes, and snippets.

@bruckhaus
Last active August 29, 2015 14:12
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save bruckhaus/05e5e2cf0a981044849e to your computer and use it in GitHub Desktop.
Save bruckhaus/05e5e2cf0a981044849e to your computer and use it in GitHub Desktop.
__author__ = 'tbruckhaus'
class ThousandDigitFibonacciNumber:
"""
1000-digit Fibonacci number
Problem 25
The Fibonacci sequence is defined by the recurrence relation:
Fn = Fn-1 + Fn-2, where F1 = 1 and F2 = 1.
Hence the first 12 terms will be:
F1 = 1
F2 = 1
F3 = 2
F4 = 3
F5 = 5
F6 = 8
F7 = 13
F8 = 21
F9 = 34
F10 = 55
F11 = 89
F12 = 144
The 12th term, F12, is the first term to contain three digits.
What is the first term in the Fibonacci sequence to contain 1000 digits?
"""
def __init__(self):
pass
@staticmethod
def find(digits):
last = 0
this = 1
term = 1
while len(str(this)) < digits:
term += 1
new = last + this
last = this
this = new
return term
if __name__ == '__main__':
t = ThousandDigitFibonacciNumber.find(1000)
print "The first term in the Fibonacci sequence to contain 1000 digits is", t
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment