1000-digit Fibonacci number 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. Hence the first 12 terms will be: F 1 = 1 F 2 = 1 F 3 = 2 F 4 = 3 F 5 = 5 F 6 = 8 F 7 = 13 F 8 = 21 F 9 = 34 F 10 = 55 F 11 = 89 F 12 = 144 The 12th term, F 12 , is the first term to contain three digits. What is the index of the first term in the Fibonacci sequence to contain 1000 digits? I know that if you have learned programming(Whatever may be the source) you should have come across this sequence called as Fibonacci sequence named after Fibonacci . Even if you have not come across this sequence at any time in your life, not a problem then to. Fibonacci is a very simple sequence. we start with 0,1, the next number will be 1(0+1), next number will be 2(1+1), next number will be 3(2+1) and so on. Briefly present number in the sequence is the sum of the previous two terms in the sequence. Now to solve ...
With Radius of Circle, people can learn to program and have hands-on tutorials with python and Matlab. ProjectEuler problems solutions are also available to have a better solution and improve the knowledge of people. A lot of algorithms which form the basic programming are also available. I hope the internet community will make use of this blog.