Talk:Fibonacci sequence: Difference between revisions
Content added Content deleted
m (→Alternative: removed space characters adjoining <math> tags causing formula to be blank) |
(→Alternative: Thanks - you caught the what I hope is one of the last of *many* formulae with Gerard accidentally made invisible :() |
||
Line 51: | 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. --> |
<!-- 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. |
Fibonacci sequence can also be calculated using this formula. |
||
<big><big><math>Fib[n] = \frac{(1+\sqrt{5})^n - (1-\sqrt{5})^n}{2^n \sqrt{5}}</math></big></big> |
|||
Size of the floating-point type (float, double, long double etc..) will limit how high n can be calulated. |
Size of the floating-point type (float, double, long double etc..) will limit how high n can be calulated. |
||