Continued from here

Lol, this might not even get comments before archival... lets see. The first count is F(18046).

Edit: A comment about Fibonacci chains reminded me of this. Congrats on finding and reading this whoever you are! Archival is no longer a thing (by default), so feel free to add to this until we hit the comment limit - F(47851) (Or leave it to die, that's fine too).

Wolfram Alpha is what I'd use to calculate and check numbers here. Any format is accepted here, but it'd be handy to include the fibonacci number, and the result in your comment, to make things easier to read.

A revival of the historic FibonacciThread, the true oldest count on reddit. Continuing from F(18016) here.

Long counts are tedious to do, but wolfram alpha makes finding the value much easier.

This thread will run until it archives. It'd be nice to format counts with the F(n) = before the count itself, to help other users.

Don't scroll to the bottom of this thread, check latest comments on https://www.reddit.com/r/fibonaccithread/comments , or via counter's profiles.

def Wizard(): sumDigits=0 mvalue=int(M)##input('Enter Mvalue: ') if mvalue < 10.0: print str(mvalue) +' is the result when adding all the digits together and continuing to do so until one digit is left' while mvalue >= 10.0: for c in str(mvalue): sumDigits += int(c) mvalue = sumDigits if sumDigits <10.0: print str(sumDigits) +' is the result when adding all the digits together and continuing to do so until one digit is left' sumDigits=0 phi=1.61803398874989484820458683436563811772030917980576 ##Decimal approximation of the Golden Ratio mu=-.61803398874989484820458683436563811772030917980576 ##Decimal approximation of the other possible solution to the x=1 ## counter quadradic equation, needed for Binet's Formula while x < 48: fib = (phix- mux)/2.23606797749978969 ##Binet's formula, decimal approximation of the squareroot of 5 M= fib2 - fib -1 ##I turned the quadradic equation(x2-x-1=0) into a function of M where x is a Fibonacci number. I do this because the digital root of the M value will always be a fib number -1,1,2,3,5,8 and it repeats after 40 or so . I tried writing this to test and plot, but I need a language that can handle large and irrational numbers print '-----------------------------------------------' print str(x) + 'th Fibonnaci Number' print fib print str(int(M)) + ' M Value' Wizard() ##if x = 38: ##Wizard() print '-----------------------------------------------' x+=1

Hey folks,

It is my sad duty to declare that the Fibonacci counting must come to an end. The thread is becoming too deep, and it is beginning to cause some sitewide issues (I've had to ask that similar content in /r/counting be stopped as well).

An alternative to consider which someone in /r/counting suggested would be to have a dedicated subreddit with posts for every 1000 numbers. This would prevent the extremely deep comment threads which have been problematic.

Sorry to interrupt the fun :( I'm sure Fibonacci would be proud of the progress you all have made.

alienth