![Page 1: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/1.jpg)
The Golden Ratio, Fibonacci Numbers, And Other
Recurrences
Great Theoretical Ideas In Computer Science
John Lafferty CS 15-251 Fall 2006
Lecture 13 October 10, 2006 Carnegie Mellon University
![Page 2: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/2.jpg)
Leonardo Fibonacci
In 1202, Fibonacci proposed a problem about the growth of rabbit populations.
![Page 3: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/3.jpg)
Inductive Definition or Recurrence Relation for the
Fibonacci Numbers Stage 0, Initial Condition, or Base Case:Fib(0) = 0; Fib (1) = 1
Inductive RuleFor n>1, Fib(n) = Fib(n-1) + Fib(n-2)
n 0 1 2 3 4 5 6 7
Fib(n) 0 1 1 2 3 5 813
![Page 4: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/4.jpg)
Sneezwort (Achilleaptarmica)
Each time the plant starts a new shoot it takes two months before it is strong
enough to support branching.
![Page 5: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/5.jpg)
Counting Petals
5 petals: buttercup, wild rose, larkspur,columbine (aquilegia)
8 petals: delphiniums 13 petals: ragwort, corn marigold, cineraria,
some daisies 21 petals: aster, black-eyed susan, chicory 34 petals: plantain, pyrethrum 55, 89 petals: michaelmas daisies, the
asteraceae family.
![Page 6: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/6.jpg)
Pineapple whorls
Church and Turing were both interested in the number of whorls in each ring of the spiral.
The ratio of consecutive ring lengths approaches the Golden Ratio.
![Page 7: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/7.jpg)
![Page 8: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/8.jpg)
Bernoulli Spiral When the growth of the organism is
proportional to its size
![Page 9: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/9.jpg)
Bernoulli Spiral When the growth of the organism is
proportional to its size
![Page 10: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/10.jpg)
![Page 11: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/11.jpg)
![Page 12: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/12.jpg)
Is there life after ande
Golden Ratio: the divine proportion
= 1.6180339887498948482045…
“Phi” is named after the Greek sculptor Phidias
![Page 13: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/13.jpg)
AC
AB
AB
BCAC
BCAC
BC
AB
BC
BC
BC1
1 0
2
2
2
Definition of (Euclid)
Ratio obtained when you divide a line segment into two unequal parts such that the ratio of the whole to the larger part is the same as the ratio of the larger to the smaller.
A B C
![Page 14: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/14.jpg)
Expanding Recursively
11
11
11
11
11
11
![Page 15: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/15.jpg)
Continued Fraction Representation
11
11
11
11
11
11
11
11
11
1 ....
![Page 16: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/16.jpg)
Continued Fraction Representation
11
11
11
11
11
11
11
11
11
1 ....
1 52
![Page 17: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/17.jpg)
Remember?
We already saw the convergents of this CF[1,1,1,1,1,1,1,1,1,1,1,…]
are of the formFib(n+1)/Fib(n)
n1
1 5l m
2i
n
n
FF
Hence:
![Page 18: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/18.jpg)
Continued Fraction Representation
11
11
11
11
11
11
11
11
11
1 ....
![Page 19: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/19.jpg)
1,1,2,3,5,8,13,21,34,55,….
2/1 = 23/2 = 1.55/3 = 1.666…8/5 = 1.613/8 = 1.62521/13 = 1.6153846…34/21 = 1.61904…
= 1.6180339887498948482045
![Page 20: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/20.jpg)
Continued fraction representation of a standard fraction
67 12
129 31
42
![Page 21: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/21.jpg)
e.g., 67/29 = 2 with remainder 9/29= 2 + 1/ (29/9)
67 1 1 12 2 2
29 2 129 3 319 9 42
![Page 22: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/22.jpg)
A Representational Correspondence
67 1 1 12 2 2
29 2 129 3 319 9 42
Euclid(67,29) 67 div 29 = 2Euclid(29,9) 29 div 9 = 3Euclid(9,2) 9 div 2 = 4Euclid(2,1) 2 div 1 = 2Euclid(1,0)
![Page 23: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/23.jpg)
Euclid’s GCD = Continued Fractions
Euclid(A,B) = Euclid(B, A mod B)Stop when B=0
1
mod
A ABB B
A B
Theorem: All fractions have finite continuous fraction expansions
![Page 24: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/24.jpg)
Let us take a slight detour and look at
a different representation.
![Page 25: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/25.jpg)
Sequences That Sum To n
Let fn+1 be the number of different sequences of 1’s and 2’s that sum to n.
Example: f5 = 5
![Page 26: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/26.jpg)
Sequences That Sum To n
Let fn+1 be the number of different sequences of 1’s and 2’s that sum to n.
Example: f5 = 5
4 = 2 + 2
2 + 1 + 11 + 2 + 11 + 1 + 21 + 1 + 1 + 1
![Page 27: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/27.jpg)
Sequences That Sum To n
f1
f2
f3
Let fn+1 be the number of different sequences of 1’s and 2’s that sum to n.
![Page 28: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/28.jpg)
Sequences That Sum To n
f1 = 1
0 = the empty sumf2 = 1
1 = 1
f3 = 2
2 = 1 + 1
2
Let fn+1 be the number of different sequences of 1’s and 2’s that sum to n.
![Page 29: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/29.jpg)
Sequences That Sum To n
fn+1 = fn + fn-1
Let fn+1 be the number of different sequences of 1’s and 2’s that sum to n.
![Page 30: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/30.jpg)
Sequences That Sum To n
fn+1 = fn + fn-1
Let fn+1 be the number of different sequences of 1’s and 2’s that sum to n.
# of sequences beginning with a 2
# of sequences beginning with a 1
![Page 31: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/31.jpg)
Fibonacci Numbers Again
ffn+1n+1 = f = fnn + f + fn-1n-1
ff11 = 1 f = 1 f22 = 1 = 1
Let fn+1 be the number of different sequences of 1’s and 2’s that sum to
n.
![Page 32: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/32.jpg)
Visual Representation: Tiling
Let fn+1 be the number of different ways to tile a 1 × n strip with squares and dominoes.
![Page 33: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/33.jpg)
Visual Representation: Tiling
Let fn+1 be the number of different ways to tile a 1 × n strip with squares and dominoes.
![Page 34: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/34.jpg)
Visual Representation: Tiling
1 way to tile a strip of length 0
1 way to tile a strip of length 1:
2 ways to tile a strip of length 2:
![Page 35: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/35.jpg)
fn+1 = fn + fn-1
fn+1 is number of ways to tile length n.
fn tilings that start with a square.
fn-1 tilings that start with a domino.
![Page 36: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/36.jpg)
Let’s use this visual representation to prove a couple of
Fibonacci identities.
![Page 37: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/37.jpg)
Fibonacci Identities
Some examples:
F2n = F1 + F3 + F5 + … + F2n-1
Fm+n+1 = Fm+1 Fn+1 + Fm Fn
(Fn)2 = Fn-1 Fn+1 + (-1)n
![Page 38: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/38.jpg)
Fm+n+1 = Fm+1 Fn+1 + Fm Fn
mm nn
m-1m-1 n-1n-1
![Page 39: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/39.jpg)
(Fn)2 = Fn-1 Fn+1 + (-1)n
![Page 40: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/40.jpg)
(Fn)2 = Fn-1 Fn+1 + (-1)n
n-1n-1
Fn tilings of a strip of length n-1
![Page 41: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/41.jpg)
(Fn)2 = Fn-1 Fn+1 + (-1)n
n-1n-1
n-1n-1
![Page 42: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/42.jpg)
(Fn)2 = Fn-1 Fn+1 + (-1)n
nn
(Fn)2 tilings of two strips of size n-1
![Page 43: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/43.jpg)
(Fn)2 = Fn-1 Fn+1 + (-1)n
nn
Draw a vertical “fault Draw a vertical “fault line” at the line” at the rightmost rightmost
position position (<n)(<n) possible without possible without
cutting any cutting any dominoes dominoes
![Page 44: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/44.jpg)
(Fn)2 = Fn-1 Fn+1 + (-1)n
nn
Swap the tailsSwap the tails at the at the fault linefault line to map to a to map to a tiling of 2 n-1 ‘s to a tiling of 2 n-1 ‘s to a tiling of an n-2 and an tiling of an n-2 and an n.n.
![Page 45: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/45.jpg)
(Fn)2 = Fn-1 Fn+1 + (-1)n
nn
Swap the tailsSwap the tails at the at the fault linefault line to map to a to map to a tiling of 2 n-1 ‘s to a tiling of 2 n-1 ‘s to a tiling of an n-2 and an tiling of an n-2 and an n.n.
![Page 46: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/46.jpg)
(Fn)2 = Fn-1 Fn+1 + (-1)n-1
n n eveneven
n oddn odd
![Page 47: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/47.jpg)
More random facts
The product of any four consecutive Fibonacci numbers is the area of a Pythagorean triangle.
The sequence of final digits in Fibonacci numbers repeats in cycles of 60. The last two digits repeat in 300, the last three in 1500, the last four in 15,000, etc.
Useful to convert miles to kilometers.
![Page 48: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/48.jpg)
The Fibonacci Quarterly
![Page 49: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/49.jpg)
Let’s take a break from the Fibonacci Numbers in order
to talk about polynomial division.
![Page 50: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/50.jpg)
How to divide polynomials?
1 1
1 – X?
1 – X 1
1
-(1 – X)
X
+ X
-(X – X2)
X2
+ X2
-(X2 – X3)
X3
=1 + X + X2 + X3 + X4 + X5 + X6 + X7 + …
…
![Page 51: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/51.jpg)
1 + X1 + X11 + X + X22 + X + X33 + … + X + … + Xn-1n-1 + X + Xnn = = XXn+1 n+1 - 1- 1
XX - 1- 1
The Geometric Series
![Page 52: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/52.jpg)
1 + X1 + X11 + X + X22 + X + X33 + … + X + … + Xn-1n-1 + X + Xnn = = XXn+1 n+1 - 1- 1
XX - 1- 1
The limit as n goes to infinity of
XXn+1 n+1 - 1- 1
XX - 1- 1
= - 1- 1
XX - 1- 1
= 11
1 - X1 - X
![Page 53: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/53.jpg)
1 + X1 + X11 + X + X22 + X + X33 + … + X + … + Xnn + ….. = + ….. = 11
1 - X1 - X
The Infinite Geometric Series
![Page 54: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/54.jpg)
(X-1) ( 1 + X1 + X2 + X 3 + … + Xn + … )= X1 + X2 + X 3 + … + Xn + Xn+1
+ …. - 1 - X1 - X2 - X 3 - … - Xn-1 – Xn - Xn+1 - …
= 1
1 + X1 + X11 + X + X22 + X + X33 + … + X + … + Xnn + ….. = + ….. = 11
1 - X1 - X
![Page 55: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/55.jpg)
1 + X1 + X11 + X + X22 + X + X33 + … + X + … + Xnn + ….. = + ….. = 11
1 - X1 - X
1 – X 1
1
-(1 – X)
X
+ X
-(X – X2)
X2
+ X2 + …
-(X2 – X3)
X3…
![Page 56: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/56.jpg)
X X 1 – X – X2
Something a bit more complicated
1 – X – X2 X
X2 + X3
-(X – X2 – X3)
X
2X3 + X4
-(X2 – X3 – X4)
+ X2
-(2X3 – 2X4 – 2X5)
+ 2X3
3X4 + 2X5
+ 3X4
-(3X4 – 3X5 – 3X6)
5X5 + 3X6
+ 5X5
-(5X5 – 5X6 – 5X7)
8X6 + 5X7
+ 8X6
-(8X6 – 8X7 – 8X8)
![Page 57: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/57.jpg)
Hence
= F0 1 + F1 X1 + F2 X2 +F3 X3 + F4 X4 +
F5 X5 + F6 X6 + …
X X
1 – X – X2
= 01 + 1 X1 + 1 X2 + 2X3 + 3X4 + 5X5 + 8X6 + …
![Page 58: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/58.jpg)
Going the Other Way
(1 - X- X2) ( F0 1 + F1 X1 + F2 X2 + … + Fn-2 Xn-2 + Fn-1 Xn-1 + Fn Xn + …
F0 = 0, F1 = 1
![Page 59: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/59.jpg)
Going the Other Way
(1 - X- X2) ( F0 1 + F1 X1 + F2 X2 + … + Fn-2 Xn-2 + Fn-1 Xn-1 + Fn Xn + …
= ( F0 1 + F1 X1 + F2 X2 + … + Fn-2 Xn-2 + Fn-1 Xn-1 + Fn Xn + …
- F0 X1 - F1 X2 - … - Fn-3 Xn-2 - Fn-2 Xn-1 - Fn-1 Xn - … - F0 X2 - … - Fn-4 Xn-2 - Fn-3 Xn-1 - Fn-2 Xn - …
= F0 1 + ( F1 – F0 ) X1 F0 = 0, F1 = 1= X
![Page 60: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/60.jpg)
Thus
F0 1 + F1 X1 + F2 X2 + … + Fn-1 Xn-1 + Fn Xn + …
X X
1 – X – X2=
![Page 61: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/61.jpg)
So much for trying to take a
break from the Fibonacci
numbers…
![Page 62: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/62.jpg)
What is the Power Series Expansion of x/(1-x-x2) ?
What does this look like when we expand it as an
infinite sum?
![Page 63: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/63.jpg)
Since the bottom is quadratic we can factor it.
X / (1-X-X2) =
X/(1- X)(1 – (-)-1X)
where =
“The Golden Ratio”
![Page 64: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/64.jpg)
XX
(1 – (1 – X)(1- (-X)(1- (-))--
11X)X)
Linear factors on the bottom
n=0..∞= Xn?
![Page 65: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/65.jpg)
(1 + aX1 + a2X2 + … + anXn + …..) (1 + bX1 + b2X2 + … + bnXn
+ …..) =
11
(1 – aX)(1-bX)(1 – aX)(1-bX)
Geometric Series (Quadratic Form)
aan+1 n+1 – – bbn+1n+1
aa - b- b
n=0..∞ Xn
=
=
![Page 66: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/66.jpg)
11
(1 – (1 – X)(1- (-X)(1- (--1-1X)X)
Geometric Series (Quadratic Form)
n+1 n+1 – (-– (---1)1)n+1n+1
√√5 5 n=0.. ∞
= Xn
![Page 67: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/67.jpg)
XX
(1 – (1 – X)(1- (-X)(1- (--1-1X)X)
Power Series Expansion of F
n+1 n+1 – (-– (---1)1)n+1n+1
√√55 n=0.. ∞
= Xn+1
![Page 68: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/68.jpg)
0 1 2 30 1 2 32
01i
ii
xF x F x F x F x F x
x x
20
1 1
1 5
i
i i
i
xx
x x
![Page 69: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/69.jpg)
The ith Fibonacci number is:
0
1 1
5
i
i
i
Leonhard Euler (1765) J. P. M. Binet (1843)A de Moivre (1730)
![Page 70: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/70.jpg)
F
F
n
n
FHG
IKJ
FHG
IKJ
LNM
OQP
n
n
n
n
n n
1
5 5
1
5
5 5 closest integer to
Less than .27
7
![Page 71: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/71.jpg)
F
F
F
F
n
n
n
n
FHG
IKJ
FHG
IKJ
FHG
IKJ
FHG
IKJ
FHG
IKJ
1 1
1
1
1
1
1
1
1
1 1
1
1
n
n
n
n
n
n
n
n
n
n
nlim
![Page 72: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/72.jpg)
What is the coefficient of Xk in the expansion of:
( 1 + X + X2 + X3 + X4
+ . . . . )n ?
Each path in the choice tree for the cross terms has n choices of exponent e1, e2, . . . , en ¸ 0. Each exponent can be any natural number.
Coefficient of Xk is the number of non-negative solutions to:
e1 + e2 + . . . + en = k
![Page 73: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/73.jpg)
What is the coefficient of Xk in the expansion of:
( 1 + X + X2 + X3 + X4
+ . . . . )n ?
n
n -1
1k
![Page 74: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/74.jpg)
( 1 + X + X2 + X3 + X4
+ . . . . )n =
k
k 0
nX
n -1
11
1n
k
X
![Page 75: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/75.jpg)
What is the coefficient of Xk in the expansion of:
(a0 + a1X + a2X2 + a3X3 + …) ( 1 + X + X2 + X3
+ . . . )
= (a0 + a1X + a2X2 + a3X3 + …) / (1 – X) ?
a0 + a1 + a2 + .. + ak
![Page 76: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/76.jpg)
(a0 + a1X + a2X2 + a3X3 + …) / (1
– X)
= k
k 0 i 0
a X
i k
i
![Page 77: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/77.jpg)
Some simple power series
![Page 78: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/78.jpg)
Al-Karaji’s Identities
Zero_Ave = 1/(1-X);First_Ave = 1/(1-X)2;Second_Ave = 1/(1-X)3;
Output = 1/(1-X)2 + 2X/(1-X)3
= (1-X)/(1-X)= (1-X)/(1-X)3 3 + 2X/(1-X)+ 2X/(1-X)3 3
= (1+X)/(1-X)= (1+X)/(1-X)33
![Page 79: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/79.jpg)
(1+X)/(1-X)(1+X)/(1-X)3 3 outputs <1, 4, 9, ..>outputs <1, 4, 9, ..>
X(1+X)/(1-X)X(1+X)/(1-X)3 3 outputs <0, 1, 4, 9, ..>outputs <0, 1, 4, 9, ..>
The kThe kthth entry is k entry is k22
![Page 80: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/80.jpg)
X(1+X)/(1-X)X(1+X)/(1-X)3 3 = = k k22XXkk
What does X(1+X)/(1-X)What does X(1+X)/(1-X)44 do?do?
![Page 81: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/81.jpg)
X(1+X)/(1-X)X(1+X)/(1-X)44 expands to : expands to :
SSkk X Xkk
where Swhere Skk is the sum of the is the sum of the first k squaresfirst k squares
![Page 82: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/82.jpg)
Aha! Thus, if there is an Aha! Thus, if there is an alternative interpretation of alternative interpretation of
the kthe kthth coefficient of coefficient of X(1+X)/(1-X)X(1+X)/(1-X)44
we would have a new way we would have a new way to get a formula for the sum to get a formula for the sum
of the first k squares.of the first k squares.
![Page 83: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/83.jpg)
Using pirates and gold we found that:
k
k 0
nX
n -1
11
1n
k
X
k
k 0
X3
4
31
1
k
X
THUS:
![Page 84: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/84.jpg)
Coefficient of Xk in PV = (X2+X)(1-X)-4
is the sum of the first k squares:
k
k 0
X3
4
31
1
k
X
![Page 85: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/85.jpg)
Polynomials give us closed form expressions
![Page 86: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/86.jpg)
REFERENCES
Coxeter, H. S. M. ``The Golden Section, Phyllotaxis, and Wythoff's Game.'' Scripta Mathematica 19, 135-143, 1953.
"Recounting Fibonacci and Lucas Identities" by Arthur T. Benjamin and Jennifer J. Quinn, College Mathematics Journal, Vol. 30(5): 359--366, 1999.
![Page 87: The Golden Ratio, Fibonacci Numbers, And Other Recurrences Great Theoretical Ideas In Computer Science John LaffertyCS 15-251 Fall 2006 Lecture 13October](https://reader035.vdocuments.us/reader035/viewer/2022062516/56649dce5503460f94ac1a4c/html5/thumbnails/87.jpg)
Study Bee
Fibonacci Numbers Arise everywhere Visual Representations Fibonacci Identities
Polynomials The infinite geometric series Division of polynomials Representation of Fibonacci numbers
as coefficients of polynomials. Generating Functions and Power Series Simple operations (add, multiply) Quadratic form of the Geometric Series Deriving the closed form for Fn
Pirates and gold Sum of squares once again!