A Conversation for Miscellaneous Chat
The Fibonacci Series
Peet (the Pedantic Punctuation Policeman, Muse of Lateral Programming Ideas, Eggcups-Spurtle-and-Spoonswinner, BBC Cheese Namer & Zaphodista) Posted Sep 9, 2002
The Fibonacci Series
Mu Beta Posted Sep 9, 2002
17711
Is anyone still working these out in their heads?
B
The Fibonacci Series
Sho - employed again! Posted Sep 9, 2002
46,368
and I used a calculator - mental arithmetic is way beyond Monday morning brain activity for me
The Fibonacci Series
Mu Beta Posted Sep 9, 2002
75,025
This could become a useful reference in future. If you ever get asked "what's the 25th number in the Fibonacci series?", you'll know exactly where to find it
B
The Fibonacci Series
Sho - employed again! Posted Sep 9, 2002
121,393
I only did that so I could ask a Fibonacci related question:
I understood that the series only had to begin with two seeds? do they have to be 0 and 1? Could it be 6 and 7? or 5 and 34?
In which case there is no 25th number unless you specify what the seeds are.
I'm confused now.
The Fibonacci Series
Captain_SpankMunki [Keeper & Former ACE] Thanking <Diety of choice> for the joy of Goo. Posted Sep 9, 2002
196,418
I was expecting this thread to get dumped to the bottom of Ask Hootoo.
Liam.
The Fibonacci Series
Mu Beta Posted Sep 9, 2002
317,811
It's amazing what'll keep going if we're provoked.
My understanding of the Fibonacci sequence is that it specifically grows out of a field of nulls, needing only the smallest seed (ie. 1). Obviously, it'd work with 6 & 7, or whatever, but it wouldn't be a Fibonacci series, just a bunch of numbers you're adding together.
B
The Fibonacci Series
Giford Posted Sep 9, 2002
Ah, Liam, I was starting to wonder where you had got to after kicking this off ...
I think that the Fibonacci sequence is the specific sequence Fibonacci noticed, e.g. it has to start 0,1. (He spotted it in various places in nature, apparently.) So is there a name for Fibonacci-like sequences?
Yes, I am still doing these in my head.
Gif
P.S. 514,229
The Fibonacci Series
Marjin, After a long time of procrastination back lurking Posted Sep 9, 2002
We just passed A471151.
Interesting question: which seeds will bring up 471151 somewhere?
832040
The Fibonacci Series
Hoovooloo Posted Sep 9, 2002
1346269
In answer to Marjin's question:
235575 and 235576 (interesting, two consecutive numbers...)
188459 and 141346
137720 and 65237
114057 and 25796
96899 and -1668
87203 and -17421.
How's that?
H.
The Fibonacci Series
Marjin, After a long time of procrastination back lurking Posted Sep 9, 2002
2,178,309
That is what you get for not being exacly enough.
471,151 and 0 or 471,150 and 1 would also work.
I was actually looking for the smallest two positive whole numbers that would somewhere have 471,151 in its series.
The Fibonacci Series
Sho - employed again! Posted Sep 9, 2002
2,178,309
Um... this is weird, I looked at the entry yesterday, and it deffo only mentions 2 seed numbers, not that they had to begin with 0 and 1 (and this thread began only with 0)....
so, is the Fibonacci thing only the sequence that starts 0,1...
or can it be any sequence given any two seeds?
The Fibonacci Series
Marjin, After a long time of procrastination back lurking Posted Sep 9, 2002
YAY the first doublepost!!!
3,524,578 to ignore the double.
The Fibonacci Series
Hoovooloo Posted Sep 9, 2002
5702887
OK, if you're going to start being picky, Marjin
The *smallest* *integer* solution I could find was:
307 and 753
Put those at position 1 and 2, and your target pops up at position 16. Couldn't find any lower ones than that. Interesting problem. I wonder if there are any (1) practical uses (2) lower solutions (3) actual algorithms for doing this. Anyone?
H.
The Fibonacci Series
GreyDesk Posted Sep 9, 2002
14,930,352
Will this do? http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/fibFormula.html
The Fibonacci Series
Marjin, After a long time of procrastination back lurking Posted Sep 9, 2002
24,157,817
Not quit, it finds the next number, not the previous of a generalised series.
I found http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/fibFormulae.html
with G(n) = G(0) F(n – 1) + G(1) F(n) where G(n) = the n-th number, G(0) and G(1) the seeds and F(n) the n-th Fibonacci number.
Gives some work to do.
Key: Complain about this post
The Fibonacci Series
- 21: Peet (the Pedantic Punctuation Policeman, Muse of Lateral Programming Ideas, Eggcups-Spurtle-and-Spoonswinner, BBC Cheese Namer & Zaphodista) (Sep 9, 2002)
- 22: Mu Beta (Sep 9, 2002)
- 23: Orcus (Sep 9, 2002)
- 24: Mu Beta (Sep 9, 2002)
- 25: Orcus (Sep 9, 2002)
- 26: Sho - employed again! (Sep 9, 2002)
- 27: Mu Beta (Sep 9, 2002)
- 28: Sho - employed again! (Sep 9, 2002)
- 29: Captain_SpankMunki [Keeper & Former ACE] Thanking <Diety of choice> for the joy of Goo. (Sep 9, 2002)
- 30: Mu Beta (Sep 9, 2002)
- 31: Giford (Sep 9, 2002)
- 32: Marjin, After a long time of procrastination back lurking (Sep 9, 2002)
- 33: Hoovooloo (Sep 9, 2002)
- 34: Marjin, After a long time of procrastination back lurking (Sep 9, 2002)
- 35: Sho - employed again! (Sep 9, 2002)
- 36: Marjin, After a long time of procrastination back lurking (Sep 9, 2002)
- 37: Hoovooloo (Sep 9, 2002)
- 38: GreyDesk (Sep 9, 2002)
- 39: GreyDesk (Sep 9, 2002)
- 40: Marjin, After a long time of procrastination back lurking (Sep 9, 2002)
More Conversations for Miscellaneous Chat
Write an Entry
"The Hitchhiker's Guide to the Galaxy is a wholly remarkable book. It has been compiled and recompiled many times and under many different editorships. It contains contributions from countless numbers of travellers and researchers."