hosted by the Harvey Mudd College Math Department created, authored and ©1999-2010 by Francis Su

The Math Fun Facts App!

List All : List Recent : List Popular
About Math Fun Facts / How to Use
Contributors / Fun Facts Home
© 1999-2010 by Francis Edward Su

From the Fun Fact files, here is a Fun Fact at the Easy level:

# Fibonacci Number Formula

The Fibonacci numbers are generated by setting F0=0, F1=1, and then using the recursive formula

Fn = Fn-1 + Fn-2

to get the rest. Thus the sequence begins: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... This sequence of Fibonacci numbers arises all over mathematics and also in nature.

However, if I wanted the 100th term of this sequence, it would take lots of intermediate calculations with the recursive formula to get a result. Is there an easier way?

Yes, there is an exact formula for the n-th term! It is:

an = [ Phin - (phi)n ]/Sqrt[5].

where Phi=(1+Sqrt[5])/2 is the so-called golden mean, and phi=(1-Sqrt[5])/2 is an associated golden number, also equal to (-1/Phi). This formula is attributed to Binet in 1843, though known by Euler before him.

The Math Behind the Fact:
The formula can be proved by induction. It can also be proved using the eigenvalues of a 2x2-matrix that encodes the recurrence. You can learn more about recurrence formulas in a fun course called discrete mathematics.

Su, Francis E., et al. "Fibonacci Number Formula." Math Fun Facts. <http://www.math.hmc.edu/funfacts>.

Keywords:    proof by induction, combinatorics, Binet's formula
Subjects:    combinatorics, number theory
Level:    Easy
Fun Fact suggested by:   Arthur Benjamin
Suggestions? Use this form.
3.96
current
rating
Click to rate this Fun Fact...
*   Awesome! I totally dig it!
*   Fun enough to tell a friend!
*   Mildly interesting
*   Not really noteworthy
and see the most popular Facts!
New: get the MathFeed iPhone App!

Brings you news and views on math:
showcasing its power, beauty, and humanity

Want another Math Fun Fact?

For more fun, tour the Mathematics Department at Harvey Mudd College!
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://www.math.hmc.edu/funfacts/ffiles/10002.4-5.shtml", "fetch_time": 1568941684000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2019-39/segments/1568514573801.14/warc/CC-MAIN-20190920005656-20190920031656-00082.warc.gz", "warc_record_offset": 937452013, "warc_record_length": 6655, "token_count": 541, "char_count": 2052, "score": 3.671875, "int_score": 4, "crawl": "CC-MAIN-2019-39", "snapshot_type": "latest", "language": "en", "language_score": 0.8713750243186951, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00056-of-00064.parquet"}