Project Euler/25

← Back to User:ProjectEuler

Project Euler Problem 25 is a problem related to Fibonacci numbers. It requires you to find the smallest Fibonacci number with 1000 digits.

This article is not detailed enough and needs to be expanded. Please help us by adding some more information.

Implementations

Python

By User:None1.

a,b=1,1
while len(str(a))<1000:a,b=b,a+b
print(a)