Beruflich Dokumente
Kultur Dokumente
FIBONACCI SERIES
Definition: Start with two numbers 0 and 1 F(0) = 0 F(1) = 1 F(n) = F(n-1) + F (n-2) n >1 The series 0 1 1 2 3 5 8 13 21 34 55 ... is called the Fibonacci Series History: Leonardo of Pisa (1170 1250) Liber Abaci (1202). Crusader for the Hindu-Arabic number system in Europe Decimal notation and symbol zero. (slide) Origin: Fibonacci Series is the solution to the Rabbit Problem: There is a pair of rabbits to start with. Each pair gives birth to a new pair once a month starting 2 months after birth. Rabbits dont die. How many rabbits are there after 12 m? The Fibonacci Series gives the number of pairs of rabbits month by month.
SANSKRIT PROSODY
Sanskrit verse has words of two kinds: (1) one syllable (S) and two syllables (L). how many ways can a cadence of n syllables In be created? (Acharya Hemachandra, 1150) # of cadences S 1= F(2) SS L 2 =F(3) SSS LS SL 3 =F(4) SSSS LSS SLS SSL LL 5 =F(5) SSSSS LSSS SLSS SSLS LLS SSSL LSL SLL 8 =F(6) Ans: F (n+1). To find the number of cadences of length n, add an S to all cadences of length n - 1 and L to all cadences of length n 2. F(n) = F(n 1) + F (n 2) Hemachandras work precedes Fibonaccis by 50 years. Equivalently: in how many ways can n be made up as sums of 1s and 2s, treating the order as important? Ans. F(n+1). (Knuth) n 1 2 3 4 5
GOLDEN RATIO
Fibonacci Series: 0 1 1 2 3 5 8 13 21 .... Define ratio R(n) = F(n+1)/F(n) n = 1,2,3.... 1/1=1 2/1=2 3/2=1.5 5/3=1.667 8/5=1.6 For large n, R(n) tends to 1.618034 .... called the Golden Ratio (). The ratios are alternately more and less than . (slide) = (1 + 51/2)/2 For large n, the series tends to a geometric progression with common ratio . To calculate If (a b c) are three consecutive FNs b/a = = c/b = (a+b)/b = 1+ (1/) 2 1 = 0 Solutions: = (1 + 51/2)/2 or (1 51/2)/2. Euclid: |------A-------|---B-----| If A/B = (A+B)/A, then A/B = .
1.61803399
R = F(n+1)/F(n)
F (n) F (n+1)
1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765 10946
R - phi
-0.61803399 0.38196601 -0.11803399 0.04863268 -0.01803399 0.00696601 -0.00264937 0.00101363 -0.00038693 0.00014783 -0.00005646 0.00002157 -0.00000824 0.00000315 -0.00000120 0.00000046 -0.00000018 0.00000007 -0.00000003 0.00000001
1 2 1.5 1.666666667 1.6 1.625 1.615384615 1.619047619 1.617647059 1.618181818 1.617977528 1.618055556 1.618025751 1.618037135 1.618032787 1.618034448 1.618033813 1.618034056 1.618033963 1.618033999
Formula for F(n) F(n) = (1/5 )[ (1-) ] where = 1.618034... = (1 + 5 )/2 1/2 .... (1-) =-0.618304... = (1 - 5 )/2. For large n
n 1/2 1/2 1/2 n n
F(n) = /5
1/2
F(n) = /5 (rounded to nearest integer) n 1/2 F(n) = integral part of [ /5 + ] a non-recursive formula for F(n).
Continued fraction (CF): e.g. 28/11 = 2 + 6/11 = 2 + [1/(11/6)] 11/6 = 1 + 5/6 = 1 + [1/(6/5)] 6/5 = 1 + 1/5 CF of 28/11 = (2 1 1 5) (2 1 1 5 are the coefficients of CF) CF of ratio p/q is a unique representation. of the ratio F(n+1)/F(n) CF e.g 13/8 = (1 1 1 1 1 1) CF of F(n+1)/F(n) = (1 1 1 1 ...........1) in which there are n coefs all 1s. This is also apparent from = 1+ (1/) = 1+[1/(1+(1/))] .....
ALGORITHM
Given an arbitrary pair of integers (p, q) p > q What is the maximum number of steps in the computation of gcd (p, q) ? Solution: The number of steps is maximum when p, q are consecutive Fibonacci Numbers F(n), F(n+1). Lames Theorem: # of steps in gcd (p, q) < 5 (# of decimal digits in q) gcd (13,8) = gcd [F(7), F(6)]. # of steps is 4. Above result follows from: (a) # of steps in gcd [F(n+1), F(n)] is n-2 (b) F(n) = n/51/2. Applications of FNs in Computer Science: sorting of data, information retrieval generation of random numbers methods of approximation ........
FIBONACCI SPIRAL
13
5
8
1 1 3 2 2 8 1 3
IN GEOMETRY
Golden ratio () occurs in pentagons, The decagons and 3-dimension Platonic solids. 1/2 cos 36 = (1+5 )/4 = /2 If (a b c) are three consecutive FNs 2 b ca=1 2 n F(n+1) F(n-1) F(n) = (-1) Vanishing trick based on the above identity. (slides)
A C
8 13 x 5 = 65 13
D
D C
8 x 8 = 64 5
A
8 x 8 = 13 x 5 - 1
13 x 5 = 65
3
A C
5
D C
8 x 3 = 24 8
5 x 5 = 25 3
A
D B C
5x5=8x3+1
8 x 3 = 24
VARIANTS (contd)
Rabbit problem: Original: Each pair gives birth to a new pair once a month starting two months after birth. F(n) = F(n-1) + F(n-2) 1 1 2 3 5 8 13 21 34 .... If each pair starts reproducing after three months F(n) = F(n-1) + F(n-3) 1 1 2 3 4 6 9 13 19 .... If each pair starts reproducing after one month F(n) = 2 F(n-1) = 2n-1 Random Fibonacci Recursion. P(n) = P(n-1) + P(n-2) if coin flip is Heads P(n) = |P(n-1) - P(n-2)| if coin flip is Tails Ratio of consecutive terms approaches 1.1319... (Vishwanaths constant)
KOLAM DESIGNS
Decorative geometrical patterns on a regular grid of dots. A line drawing of curves and loops around the dots (Pulli Kolam) They adorn entrances to households, places of worship. Designs are simple to large ones of bewildering complexity. South Indian Folk Art is 1000+ years old. Nurtured by generations of women housewives and housemaids - in rural and urban areas. Broad rules with few constraints allow intricate, complex and creative designs.
Fibonacci Numbers: 0 1 1 2 3 5 8 13 ... Fibonacci Recursion: F(n) = F(n-1) + F(n-2) Fibonacci Kolams: Square 3x3, 5x5, 8x8, 13x13 ..... Rectangular 2x3, 3x5, 5x8, 8x13 .... They can be created using a modular approach starting from small kolams (2x2, 2x3) using the Fibonacci Recursion. To create square and rectangular kolams of arbitrary size, we can use Generalized Fibonacci Series.
GROUND RULES
Square and Rectangular grids Four-fold symmetry (rotational) only for square grids empty unit cells No Single loop. Folk Art of Kolams, generally In o four-fold symmetry for square kolams is mandatory o but empty unit cells and multiple loops are allowed o however, single loops are special and more difficult to achieve. (Anthadhi Kolam) no loose ends ! Closed loops capture evil spirits from entering homes !
BASIC EQUATIONS
Fibonacci Numbers: 0 1 1 2 3 5 8 13 21 34 55 89 .... Let Q (a b c d) be a quartet of consecutive Fibonacci numbers. e.g. Q (2 3 5 8) Identities relating a b c d b c = b2 + a b (1) d 2 = a2 + 4 b c (2) Proof: (1) c = b+a, multiplying by b b c = b2 + a b (2) d a = b+c-a = b+b = 2b d + a = c+b+a= c+c = 2c Multiplying the two eqs. d 2 a2 = 4 b c d 2 = a2 + 4 b c Geometrical interpretation (1) Big rectangle = Square + Small Rectangle (2) Big square = Small square + 4 Rectangles
c
b
c
a
c
c b
b
5 x 5 (1 2 3 5)
3 x 3 (1 1 2 3) and 3 x 5
2 x 2 (0 1 1 2) and 8 x 8 (2 3 5 8)
n 0 1
0x0 1x1 3 1x1 4 5 6 7 8 9 10 1x2 2x2 2x3 3x3 3x5 5x5 5x8 8x8 8 x 13 13 x 13 13 x 21 21 x 21 21 x 34
BLOCK II MODULES
3 4 5 6 7 8
5x8
8 x 13
13 x 13 : ( 3 5 8 13)
21 x 21 : ( 5 8 13 21)
Square and Rectangular Kolams of any desired size (n x n, m x n) can be created using Generalized Fibonacci Numbers (GFN). Generalized Fibonacci Series: Given G(1) = , G(2) = G(n) = G(n-1)+G(n-2) n >2 ( ) = (1 1) gives Fibonacci Series ( ) = (2 1) gives Lucas Series: 2 1 3 4 7 11 18 29 ........ equations for (a b c d) 4 consecutive GFNs Basic are the same as for the Fibonacci Series: b c = b2 + a b d2= a2 + 4 b c
c
b
c
a
c
c b
b
Lucas Kolam (4 x 4)
(2 1 3 4)
(0 2 2 4)
Lucas Kolams ( 7 x 7, 9 x 9)
(1 3 4 7)
(1 4 5 9)
G F Kolams (6 x 6 and 9 x 9)
(0 3 3 6)
(0 5 5 10)
G F Kolam (5 x 5 and 6 x 6)
(4 1 5 6) (3 1 4 5)
Table 1: Summary of Q = (a b c d) for Generalized Fibonacci Square Kolams of size n n 2m +1 (m = 1,2..) 4t (t = 1,2) 4t+2 (t = 1,2) a 1+2k 2k 2k b m-k 2t -k c d k
2t +1-k 2t+1+ k
17 x 17 (5 6 11 17) 5 Loops
7 12
12 7
2
2 1 2 2 5
12 x 19
5
1 2 2 5
4 7
7 3
7 x 18
7
2 1 2 2 5 5
FIGURE 7(a)
FIGURE 7(b)
FIGURE 7(b)
FIGURE 8(a)
FIGURE 8(a)
FIGURE 8(b)
5 x 5 (1 2 3 5)
I (X Y) I R(90) I
M(x) M(x)
M(y) M(y)
(Y -X)
R(90) R(180) R(-90) R(180) R(-90) R(-90) M(x) M(y) M(45) M(-45) I M(-45) M(45) M(y) M(x) I
(-X -Y) R(180) (-Y -X) (X -Y) (-X Y) (Y X) R(-90) M(x) M(y) M(45)
2 X 3 RECTANGULAR KOLAMS
(X Y)
R(90)
(Y -X)
(-X -Y)
(-Y X)
Mx
(X -Y)
My
(-X Y)
(Y X)
(-Y -X)