2012-03-30 09:15:23 +00:00
|
|
|
title: What is the first term in the Fibonacci sequence to contain 1000 digits?
|
|
|
|
|
url: http://projecteuler.net/problem=25
|
|
|
|
|
|
|
|
|
|
desc: |
|
|
|
|
|
The Fibonacci sequence is defined by the recurrence relation:
|
|
|
|
|
Fn = Fn1 + Fn2, 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?
|
|
|
|
|
solution: Bruteforce
|
|
|
|
|
|
|
|
|
|
solutions:
|
|
|
|
|
solve.php:
|
2011-04-10 11:19:21 +00:00
|
|
|
desc: Basic Solution - needs BCMath
|
|
|
|
|
language: php
|
|
|
|
|
solve.rb:
|
|
|
|
|
desc: Basic solution
|
|
|
|
|
language: ruby
|
