-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem-025.py
More file actions
36 lines (30 loc) · 776 Bytes
/
problem-025.py
File metadata and controls
36 lines (30 loc) · 776 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
### Problem 25 - 1000 Digit Fibonacci Number
###---------------------------------------------------------------------------------------
### 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 index of the first term in the Fibonacci sequence to contain 1000 digits?
### Solution
f = 1
f_prev = 1
currentIndex = 2
while True:
currentIndex += 1
f_temp = f
f = f + f_prev
f_prev = f_temp
if len(str(f)) == 1000:
break
print("First Fibonacci term with 1000 digits: " + str(currentIndex))