Fibonacci Sequence

[tennispro9911]

I'll try to. I think I found a way to make my program significantly faster. With a new algorithm and my desktop computer it took ~9 sec to get the millionth term and 3:22:000 for the 5,000,000th. I'll try 100 mil. My guess is about 15-20 hour run time.

[Ian Curtis]

Originally Posted by tennispro9911

I'll try to. I think I found a way to make my program significantly faster. With a new algorithm and my desktop computer it took ~9 sec to get the millionth term and 3:22:000 for the 5,000,000th. I'll try 100 mil. My guess is about 15-20 hour run time.

If you're going for speed, wouldn't it be a little bit faster to just use the explicit definition?

[tennispro9911]

I tried that, but it didn't work for me, with such large numbers. Feel free to see if you can get it to work yourself.

[ComradeNikolai]

Would you care to share this new algorithm? I'm interested to see it.

[bobwrit]

I found a mathimatical function to define it, thus eliminating recursion. Have fun...

((x^n)-(-x)^(-n))/sqrt(5)

where x is (1+sqrt(5))/2 and n is the Nth term of the sequence.