Talk:Fibonacci sequence: Difference between revisions
Content added Content deleted
m (→Alternative: enlarged the formula (font) so that it could be read easier.) |
m (→Alternative: moved the HTML comment around (to display less whietspace).) |
||
| Line 49: | Line 49: | ||
== Alternative == |
== Alternative == |
||
| ⚫ | |||
<!-- 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. --> |
||
| ⚫ | |||
<big><big><math> Fib[n] = \frac{(1+\sqrt{5})^n - (1-\sqrt{5})^n}{2^n \sqrt{5}} </math></big></big> |
<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. |
||