Talk:Fibonacci sequence: Difference between revisions

Talk:Fibonacci sequence (view source)

11 bytes removed , 1 year ago

→‎Alternative: Thanks - you caught the what I hope is one of the last of *many* formulae with Gerard accidentally made invisible :(

9,655

edits

Revision as of 14:50, 10 June 2022 (view source) Enter your username (talk \| contribs) m (→‎Alternative: removed space characters adjoining <math> tags causing formula to be blank) ← Older edit		Latest revision as of 15:40, 10 June 2022 (view source) Hout (talk \| contribs) (→‎Alternative: Thanks - you caught the what I hope is one of the last of many formulae with Gerard accidentally made invisible :()
Line 51: <!-- Sorry for the "changing" of someone's comment, but I couldn't read the original formula, so I though an enlarged version would be beneficial to everyone. --- Gerard Schildberger. --> Fibonacci sequence can also be calculated using this formula. ~~<big>~~<big><big><math>Fib[n] = \frac{(1+\sqrt{5})^n - (1-\sqrt{5})^n}{2^n \sqrt{5}}</math~~></big~~></big></big> Size of the floating-point type (float, double, long double etc..) will limit how high n can be calulated.