Euler Problem 104 asks: The Fibonacci sequence is defined by the recurrence relation: F(n) = F(n-1) + F(n-2), where F(1) = 1 and F(2) = 1.
It turns out that F(541), which contains 113 digits, is the first Fibonacci number for
which the last nine digits are 1-9 pandigital (contain all the digits 1 to 9, [...]
Read More...
Read the complete post at http://www.dailydoseofexcel.com/archives/2009/03/22/euler-problem-104/
Posted
Mar 22 2009, 01:18 PM
by
Daily Dose of Excel