Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, …
Mathematically, we write it as:
F(n) = F(n) + F(n-1)
This can easily be done in Python, using generators.
1 2 3 4 5 | def Fibonacci(n): a, b = 1, 1 while b < n: yield b a, b = b, a + b |
To print all the Fibonacci numbers less than 4000000,
1 2 | for i in Fibonacci(4000000): print i, |
Output:
>>> 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946 17711 28657 46368 75025 121393 196418 317811 514229 832040 1346269 2178309 3524578
Related Articles:
Popular Articles:
- Backup folders with 7-zip command line
- Insert figures to LaTeX
- Create LaTeX table easily
- Add personal signature to Lotus Notes 7
- Windows XP Service Pack 3 Final release download
Spread/Promote this article.
Digg | Del.icio.us | Stumble | Y! MyWeb | Y! Buzz | Fave It! | RedditSubscribe for free.
Subscribe to Selinap.com feed right now!
tak letak shoutbox ke eh ? hehe
Nak letak mana bagus?
[...] AboutContactArchives « Generate Fibonacci numbers with Python [...]
Actually, that should be:
a, b = 1, 0
Otherwise it won’t emit the first two, 0 and 1.
If you read carefully, I have stated “By starting with 1 and 2, the first 10 terms will be: …”.