![]() |
The Fibonacci sequence
ok I once spent 3 hours every saturday for a month doing nothing but this sequence just to kill time i assume. i fill end entire notebook with numbers. I am courisous to see just how far we can take it, the First 41 Numbers in the Sequence are as follows :
1 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 5702887 9227465 14930352 24157817 39088169 63245986 102334155 165580141 Add on! ~for those of you who dont know what this is the formula is: a(1) = 1, a(2) = 1, a(n) = a(n-2) + a(n-1) ~ good luck *** NO CALCULATORS PLEASE*** |
RE: The Fibonacci sequence
um, 267914296
|
RE: The Fibonacci sequence
f(n) = [(1 + √5)/2]^n - [(1 - √5)/2]^n
Plug 'n play. |
Damn.
I didn't see the calculator sign. |
i did it all without a calculator like.. 4,000 numbers into it... it was an uber time killer.
|
![]() photoshop in some bling oh yeah, next number is 433494437 |
| All times are GMT -5. The time now is 10:58 PM. |
Powered by vBulletin® Version 3.8.1
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.
Copyright FlashFlashRevolution