Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
|
|
- Abraham Eaton
- 5 years ago
- Views:
Transcription
1 Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang html Smith College, January 28, 2011
2 Introduction
3 Goals of the Talk See lesser known fun properties of Fibonacci numbers. Misleading proofs search for the right perspective. Importance of asking any question, not just the right one. Techniques: generating fns, differentiating identities. Help in related questions: SMALL Thanks to colleagues from the Williams College 2010 SMALL REU program (especially Ed Burger, David Clyde, Cory Colbert, Carlos Dominguez, Gea Shin and Nancy Wang).
4 Pre-requisites: Probability Review Let X be random variable with density p(x): p(x) 0; p(x)dx = 1; Prob(a X b) = b a p(x)dx.
5 5 Intro Erdos-Kac Generalizations Method Open Questions Appendix Pre-requisites: Probability Review Let X be random variable with density p(x): p(x) 0; p(x)dx = 1; Prob(a X b) = b a p(x)dx. Mean: μ = xp(x)dx. Variance: σ 2 = (x μ)2 p(x)dx.
6 Pre-requisites: Probability Review Let X be random variable with density p(x): p(x) 0; p(x)dx = 1; Prob(a X b) = b a p(x)dx. Mean: μ = xp(x)dx. Variance: σ 2 = (x μ)2 p(x)dx. Gaussian: Density (2πσ 2 ) 1/2 exp( (x μ) 2 /2σ 2 ).
7 Pre-requisites: Probability Review Let X be random variable with density p(x): p(x) 0; p(x)dx = 1; Prob(a X b) = b a p(x)dx. Mean: μ = xp(x)dx. Variance: σ 2 = (x μ)2 p(x)dx. Gaussian: Density (2πσ 2 ) 1/2 exp( (x μ) 2 /2σ 2 ). Combinatorics: ( n) k = n! k!(n k)!, n! nn e n 2πn.
8 Previous Results Fibonacci Numbers: F n+1 = F n + F n 1 ;
9 Previous Results Fibonacci Numbers: F n+1 = F n + F n 1 ; F 1 = 1, F 2 = 2, F 3 = 3, F 4 = 5,...
10 Previous Results Fibonacci Numbers: F n+1 = F n + F n 1 ; F 1 = 1, F 2 = 2, F 3 = 3, F 4 = 5,... Zeckendorf s Theorem Every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers.
11 Previous Results Fibonacci Numbers: F n+1 = F n + F n 1 ; F 1 = 1, F 2 = 2, F 3 = 3, F 4 = 5,... Zeckendorf s Theorem Every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers. Example: 2010 = = F 16 + F 13 + F 8 + F 2.
12 Previous Results Fibonacci Numbers: F n+1 = F n + F n 1 ; F 1 = 1, F 2 = 2, F 3 = 3, F 4 = 5,... Zeckendorf s Theorem Every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers. Example: 2010 = = F 16 + F 13 + F 8 + F 2. Lekkerkerker s Theorem (1952) The average number of summands in the Zeckendorf n decomposition for integers in [F n, F n+1 ) tends to φ n, where φ = is the golden mean.
13 New Results Central Limit Type Theorem As n, the distribution of the number of summands in the Zeckendorf decomposition for integers in [F n, F n+1 ) is Gaussian (normal) Figure: Number of summands in [F 2010, F 2011 ); F
14 Preliminaries: The Cookie Problem The Cookie Problem The number of ways of dividing C identical cookies among P distinct people is ( ) C+P 1 P 1.
15 Preliminaries: The Cookie Problem The Cookie Problem The number of ways of dividing C identical cookies among P distinct people is ( ) C+P 1 P 1. Proof : Consider C + P 1 cookies in a line.
16 Preliminaries: The Cookie Problem The Cookie Problem The number of ways of dividing C identical cookies among P distinct people is ( ) C+P 1 P 1. Proof : Consider C + P 1 cookies in a line. Cookie Monster eats P 1 cookies:
17 Preliminaries: The Cookie Problem The Cookie Problem The number of ways of dividing C identical cookies among P distinct people is ( ) C+P 1 P 1. Proof : Consider C + P 1 cookies in a line. Cookie Monster eats P 1 cookies: ( C+P 1) P 1 ways to do.
18 Preliminaries: The Cookie Problem The Cookie Problem The number of ways of dividing C identical cookies among P distinct people is ( ) C+P 1 P 1. Proof : Consider C + P 1 cookies in a line. Cookie Monster eats P 1 cookies: ( C+P 1) P 1 ways to do. Divides the cookies into P sets.
19 Preliminaries: The Cookie Problem The Cookie Problem The number of ways of dividing C identical cookies among P distinct people is ( ) C+P 1 P 1. Proof : Consider C + P 1 cookies in a line. Cookie Monster eats P 1 cookies: ( C+P 1) P 1 ways to do. Divides the cookies into P sets. Example: 8 cookies and 5 people (C = 8, P = 5):
20 Preliminaries: The Cookie Problem The Cookie Problem The number of ways of dividing C identical cookies among P distinct people is ( ) C+P 1 P 1. Proof : Consider C + P 1 cookies in a line. Cookie Monster eats P 1 cookies: ( C+P 1) P 1 ways to do. Divides the cookies into P sets. Example: 8 cookies and 5 people (C = 8, P = 5):
21 Preliminaries: The Cookie Problem The Cookie Problem The number of ways of dividing C identical cookies among P distinct people is ( ) C+P 1 P 1. Proof : Consider C + P 1 cookies in a line. Cookie Monster eats P 1 cookies: ( C+P 1) P 1 ways to do. Divides the cookies into P sets. Example: 8 cookies and 5 people (C = 8, P = 5):
22 Preliminaries: The Cookie Problem The Cookie Problem The number of ways of dividing C identical cookies among P distinct people is ( ) C+P 1 P 1. Proof : Consider C + P 1 cookies in a line. Cookie Monster eats P 1 cookies: ( C+P 1) P 1 ways to do. Divides the cookies into P sets. Example: 8 cookies and 5 people (C = 8, P = 5):
23 Preliminaries: The Cookie Problem: Reinterpretation Reinterpreting the Cookie Problem The number ) of solutions to x 1 + +x P = C with x i 0 is. ( C+P 1 P 1
24 Preliminaries: The Cookie Problem: Reinterpretation Reinterpreting the Cookie Problem The number ) of solutions to x 1 + +x P = C with x i 0 is. ( C+P 1 P 1 Let p n,k = # {N [F n, F n+1 ): the Zeckendorf decomposition of N has exactly k summands}.
25 Preliminaries: The Cookie Problem: Reinterpretation Reinterpreting the Cookie Problem The number ) of solutions to x 1 + +x P = C with x i 0 is. ( C+P 1 P 1 Let p n,k = # {N [F n, F n+1 ): the Zeckendorf decomposition of N has exactly k summands}. For N [F n, F n+1 ), the largest summand is F n. N = F i1 + F i2 + +F ik 1 + F n, 1 i 1 < i 2 < < i k 1 < i k = n, i j i j 1 2.
26 Preliminaries: The Cookie Problem: Reinterpretation Reinterpreting the Cookie Problem The number ) of solutions to x 1 + +x P = C with x i 0 is. ( C+P 1 P 1 Let p n,k = # {N [F n, F n+1 ): the Zeckendorf decomposition of N has exactly k summands}. For N [F n, F n+1 ), the largest summand is F n. N = F i1 + F i2 + +F ik 1 + F n, 1 i 1 < i 2 < < i k 1 < i k = n, i j i j 1 2. d 1 := i 1 1, d j := i j i j 1 2 (j > 1). d 1 + d 2 + +d k = n 2k + 1, d j 0.
27 Preliminaries: The Cookie Problem: Reinterpretation Reinterpreting the Cookie Problem The number ) of solutions to x 1 + +x P = C with x i 0 is. ( C+P 1 P 1 Let p n,k = # {N [F n, F n+1 ): the Zeckendorf decomposition of N has exactly k summands}. For N [F n, F n+1 ), the largest summand is F n. N = F i1 + F i2 + +F ik 1 + F n, 1 i 1 < i 2 < < i k 1 < i k = n, i j i j 1 2. d 1 := i 1 1, d j := i j i j 1 2 (j > 1). d 1 + d 2 + +d k = n 2k + 1, d j 0. Cookie counting p n,k = ( n 2k+1 k 1) ( k 1 = n k k 1).
28 An Erdos-Kac Type Theorem (note slightly different notation)
29 Generalizing Lekkerkerker Theorem (KKMW 2010) As n, the distribution of the number of summands in Zeckendorf s Theorem is a Gaussian Figure: Number of summands in [F 2010, F 2011 )
30 Generalizing Lekkerkerker: Erdos-Kac type result Theorem (KKMW 2010) As n, the distribution of the number of summands in Zeckendorf s Theorem is a Gaussian. Numerics: At F 100,000 : Ratio of 2m th moment σ 2m to (2m 1)!!σ2 m is between and 1 for 2m 10. Sketch of proof: Use Stirling s formula, n! n n e n 2πn to approximates binomial coefficients, after a few pages of algebra find the probabilities are approximately Gaussian.
31 (Sketch of the) Proof of Gaussianity The probability density for the number of Fibonacci numbers that add up to an integer in [F n, F n+1 ) is ( ) f n(k) = n 1 k /F k n 1. Consider the density for the n + 1 case. Then we have, by Stirling f n+1 (k) = = ( ) n k 1 k F n (n k)! 1 = (n 2k)!k! F n 1 2π (n k) n k+ 1 2 k (k+ 1 2 ) (n 2k) n 2k F n plus a lower order correction term. Also we can write F n = 1 5 φ n+1 = φ 5 φ n for large n, whereφ is the golden ratio (we are using relabeled Fibonacci numbers where 1 = F 1 occurs once to help dealing with uniqueness and F 2 = 2). We can now split the terms that exponentially depend on n. Define f n+1 (k) = ( 1 2π (n k) k(n 2k) )( 5 φ n (n k) n k ) φ k k (n 2k) n 2k. N n = Thus, write the density function as 1 (n k) 5 n k 2π k(n 2k) φ, Sn = (n k) φ n k k (n 2k) n 2k. f n+1 (k) = N ns n where N n is the first term that is of order n 1/2 and S n is the second term with exponential dependence on n.
32 (Sketch of the) Proof of Gaussianity (cont) Model the distribution as centered around the mean by the change of variable k = μ + xσ whereμ and σ are the mean and the standard deviation, and depend on n. The discrete weights of f n(k) will become continuous. This requires us to use the change of variable formula to compensate for the change of scales: Using the change of variable, we can write N n as f n(k)dk = f n(μ + σx)σdx. N n = = = = 1 n k φ 2π k(n 2k) k/n 2πn 1 2πn 1 2πn (k/n)(1 2k/n) 5 φ 1 (μ + σx)/n 5 ((μ + σx)/n)(1 2(μ + σx)/n) φ 1 C y 5 (C + y)(1 2C 2y) φ where C = μ/n 1/(φ + 2) (note that φ 2 = φ + 1) and y = σx/n. But for large n, the y term vanishes since σ n and thus y n 1/2. Thus N n 1 1 C 5 2πn C(1 2C) φ = 1 (φ + 1)(φ + 2) 5 2πn φ φ = 1 5(φ + 2) 1 = 2πn φ 2πσ 2 since σ 2 φ = n 5(φ+2).
33 (Sketch of the) Proof of Gaussianity (cont) For the second term S n, take the logarithm and once again change variables by k = μ + xσ, ( ) log(s n) = log φ n (n k) (n k) k k (n 2k) (n 2k) = n log(φ) + (n k) log(n k) (k) log(k) (n 2k) log(n 2k) = n log(φ) + (n (μ + xσ)) log(n (μ + xσ)) (μ + xσ) log(μ + xσ) (n 2(μ + xσ)) log(n 2(μ + xσ)) = n log(φ) +(n (μ + xσ)) ( ( log(n μ) + log 1 xσ n μ ( ( (μ + xσ) log(μ) + log 1 + xσ )) μ )) ( ( (n 2(μ + xσ)) log(n 2μ) + log 1 xσ )) n 2μ = n log(φ) +(n (μ + xσ)) ( ( n log ( (μ + xσ) log 1 + xσ μ ) μ 1 ) ( + log 1 xσ )) n μ ( ( ) ( n (n 2(μ + xσ)) log μ 2 + log 1 xσ )). n 2μ
34 (Sketch of the) Proof of Gaussianity (cont) Note that, since n/μ = φ + 2 for large n, the constant terms vanish. We have log(s n) ( n = n log(φ) + (n k) log ( (μ + xσ) log 1 + xσ μ ) ( n μ 1 (n 2k) log ) (n 2(μ + xσ)) log ) μ 2 ( 1 xσ n 2μ = n log(φ) + (n k) log(φ + 1) (n 2k) log(φ) + (n (μ + xσ)) log ( + (n (μ + xσ)) log 1 xσ n μ ) ( 1 xσ ) n μ ( (μ + xσ) log 1 + xσ ) ( (n 2(μ + xσ)) log 1 xσ ) μ n 2μ ( = n( log(φ) + log φ 2) log(φ)) + k(log(φ 2 ) + 2 log(φ)) + (n (μ + xσ)) log ( (μ + xσ) log 1 + xσ ) ( (n 2(μ + xσ)) log μ ( = (n (μ + xσ)) log 1 xσ n μ ( (n 2(μ + xσ)) log xσ 1 2 n 2μ ) ( (μ + xσ) log 1 + xσ μ ). ) xσ 1 2 n 2μ ) ( 1 xσ ) n μ )
35 (Sketch of the) Proof of Gaussianity (cont) Finally, we expand the logarithms and collect powers of xσ/n. log(s n) = ( (n (μ + xσ)) xσ n μ 1 ( ) xσ ) 2 n μ ( xσ (μ + xσ) μ 1 ( ) xσ ) 2 μ ( xσ (n 2(μ + xσ)) 2 n 2μ 1 ( ) xσ ) 2 n 2μ 2 = (n (μ + xσ)) xσ n (φ+1) 1 xσ 2 n (φ+1) +... (φ+2) (φ+2) 2 (μ + xσ) xσ 1 xσ +... n 2 n φ+2 φ+2 2 (n 2(μ + xσ)) 2xσ n φ 1 2xσ 2 n φ +... φ+2 φ+2 = ( ( xσ n n 1 1 ) ( (φ + 2) φ + 2 (φ + 1) ) ) φ + 2 φ + 2 φ 1 ( ) xσ 2 n( 2 φ n φ φ + 2 ) (φ + 2) (φ + 2) + 4φ φ + 1 φ +O (n(xσ/n) 3)
36 (Sketch of the) Proof of Gaussianity (cont) log(s n) = ( xσ n n φ + 1 ) φ + 2 φ + 2 φ φ φ + 2 φ + 2 φ 1 ( ) xσ 2 n(φ + 2)( 1 2 n φ ) φ ( ( ) ) xσ 3 +O n n = 1 (xσ) 2 ( ) ( ( ) ) 3φ + 4 xσ 3 (φ + 2) 2 n φ(φ + 1) O n n = 1 (xσ) 2 ( ) ( ( ) ) 3φ φ + 1 xσ 3 (φ + 2) + O n 2 n φ(φ + 1) n = 1 2 x2 σ 2 ( 5(φ + 2) φn ) ( + O n(xσ/n) 3).
37 (Sketch of the) Proof of Gaussianity (cont) But recall that σ 2 = φn 5(φ + 2). ( ) ( Also, since σ n 1/2, n xσn 3 ( ) ) n 1/2. So for large n, the O n xσn 3 term vanishes. Thus we are left with log S n = 1 2 x2 S n = e 1 2 x2. Hence, as n gets large, the density converges to the normal distribution: f n(k)dk = N ns ndk = 1 2πσ 2 e 1 2 x2 σdx = 1 2π e 1 2 x2 dx.
38 Generalizations
39 Generalizations Generalizing from Fibonacci numbers to linearly recursive sequences with arbitrary nonnegative coefficients. H n+1 = c 1 H n + c 2 H n 1 + +c L H n L+1, n L. with H 1 = 1, H n+1 = c 1 H n + c 2 H n 1 + +c n H 1 + 1, n < L, coefficients c i 0; c 1, c L > 0 if L 2; c 1 > 1 if L = 1. Zeckendorf: Every positive integer can be written uniquely as a i H i with natural constraints on the a i s (e.g. cannot use the recurrence relation to remove any summand). Lekkerkerker Central Limit Type Theorem
40 Generalizing Lekkerkerker Generalized Lekkerkerker s Theorem The average number of summands in the generalized Zeckendorf decomposition for integers in [H n, H n+1 ) tends to Cn+d as n, where C > 0 and d are computable constants determined by the c i s. C = y (1) L 1 y(1) = m=0 (s m + s m+1 1)(s m+1 s m )y m (1) 2 L 1 m=0 (m+1)(s. m+1 s m )y m (1) s 0 = 0, s m = c 1 + c 2 + +c m. y(x) is the root of 1 L 1 sm+1 1 m=0 j=s m x j y m+1. y(1) is the root of 1 c 1 y c 2 y 2 c L y L.
41 Central Limit Type Theorem Central Limit Type Theorem As n, the distribution of the number of summands, i.e., a 1 + a 2 + +a m in the generalized Zeckendorf decomposition m i=1 a ih i for integers in [H n, H n+1 ) is Gaussian
42 Example: the Special Case of L = 1 H n+1 = c 1 H n, H 1 = 1. H n = c n 1 1. Legal decomposition m i=1 a ih i : a i {0, 1,..., c 1 1} (1 i < m), a m {1,..., c 1 1}, equivalent to the c 1 -base expansion. For N [H n, H n+1 ), m = n, i.e., the first term is a n H n. A i : the corresponding random variable of a i. The A i s are independent. For large n, the contribution of A n is immaterial. A i (1 i < n) are identically distributed random variables with mean (c 1 1)/2 and variance (c 2 1 1)/12. Central Limit Theorem: A 2 + A 3 + +A n Gaussian with mean n(c 1 1)/2+O(1) and variance n(c 2 1 1)/12+O(1).
43 Far-difference Representation Theorem (Alpert, 2009) (Analogue to Zeckendorf) Every integer can be written uniquely as a sum of the ±F n s, such that every two terms of the same (opposite) sign differ in index by at least 4 (3). Example: 1900 = F 17 F 14 F 10 + F 6 + F 2. K : # of positive terms, L: # of negative terms. Generalized Lekkerkerker s Theorem As n, E[K] and E[L] n/10. E[K] E[L] = φ/ Central Limit Type Theorem As n, K and L converges to a bivariate Gaussian. corr(k, L) = (21 2φ)/(29+2φ).551, φ = K + L and K L are independent
44 Method of General Proof
45 Generating Function (Example: Binet s Formula) Binet s Formula F 1 = F 2 = 1; F n = 1 5 [ ( ) n ( ) ] n
46 Generating Function (Example: Binet s Formula) Binet s Formula F 1 = F 2 = 1; F n = 1 5 [ ( ) n ( ) ] n Recurrence relation: F n+1 = F n + F n 1 (1)
47 Generating Function (Example: Binet s Formula) Binet s Formula F 1 = F 2 = 1; F n = 1 5 [ ( ) n ( ) ] n Recurrence relation: F n+1 = F n + F n 1 (1) Generating function: g(x) = n>0 F nx n.
48 Generating Function (Example: Binet s Formula) Binet s Formula F 1 = F 2 = 1; F n = 1 5 [ ( ) n ( ) ] n Recurrence relation: F n+1 = F n + F n 1 (1) Generating function: g(x) = n>0 F nx n. (1) n 2 F n+1 x n+1 = n 2 F n x n+1 + n 2 F n 1 x n+1
49 Generating Function (Example: Binet s Formula) Binet s Formula F 1 = F 2 = 1; F n = 1 5 [ ( ) n ( ) ] n Recurrence relation: F n+1 = F n + F n 1 (1) Generating function: g(x) = n>0 F nx n. (1) n 2 F n+1 x n+1 = n 2 F n x n+1 + n 2 F n 1 x n+1 F n x n = F n x n+1 + F n x n+2 n 3 n 2 n 1
50 Generating Function (Example: Binet s Formula) Binet s Formula F 1 = F 2 = 1; F n = 1 5 [ ( ) n ( ) ] n Recurrence relation: F n+1 = F n + F n 1 (1) Generating function: g(x) = n>0 F nx n. (1) n 2 F n+1 x n+1 = n 2 F n x n+1 + n 2 F n 1 x n+1 F n x n = F n x n+1 + F n x n+2 n 3 n 2 n 1 F n x n = x F n x n + x 2 F n x n n 3 n 2 n 1
51 Generating Function (Example: Binet s Formula) Binet s Formula F 1 = F 2 = 1; F n = 1 5 [ ( ) n ( ) ] n Recurrence relation: F n+1 = F n + F n 1 (1) Generating function: g(x) = n>0 F nx n. (1) n 2 F n+1 x n+1 = n 2 F n x n+1 + n 2 F n 1 x n+1 F n x n = F n x n+1 + F n x n+2 n 3 n 2 n 1 F n x n = x F n x n + x 2 F n x n n 3 n 2 n 1 g(x) F 1 x F 2 x 2 = x(g(x) F 1 x)+x 2 g(x)
52 Generating Function (Example: Binet s Formula) Binet s Formula F 1 = F 2 = 1; F n = 1 5 [ ( ) n ( ) ] n Recurrence relation: F n+1 = F n + F n 1 (1) Generating function: g(x) = n>0 F nx n. (1) n 2 F n+1 x n+1 = n 2 F n x n+1 + n 2 F n 1 x n+1 F n x n = F n x n+1 + F n x n+2 n 3 n 2 n 1 F n x n = x F n x n + x 2 F n x n n 3 n 2 n 1 g(x) F 1 x F 2 x 2 = x(g(x) F 1 x)+x 2 g(x) g(x) = x/(1 x x 2 ).
53 Partial Fraction Expansion (Example: Binet s Formula) Generating function: g(x) = n>0 F nx n = x 1 x x 2.
54 Partial Fraction Expansion (Example: Binet s Formula) Generating function: g(x) = n>0 F nx n = Partial fraction expansion: x 1 x x 2.
55 55 Intro Erdos-Kac Generalizations Method Open Questions Appendix Partial Fraction Expansion (Example: Binet s Formula) Generating function: g(x) = n>0 F nx n = Partial fraction expansion: x 1 x x 2. g(x) = x 1 x x 2 = 1 ( x x 1+ ) 5 2 x x
56 Partial Fraction Expansion (Example: Binet s Formula) Generating function: g(x) = n>0 F nx n = Partial fraction expansion: x 1 x x 2. g(x) = x 1 x x 2 = 1 ( x x 1+ ) 5 2 x x Coefficient of x n (power series expansion): [ ( F n = 1 ) n ( ) ] n Binet s Formula!
57 57 Intro Erdos-Kac Generalizations Method Open Questions Appendix Differentiating Identities and Method of Moments Differentiating identities Example: Given a random variable X such that Prob(X = 1) = 1 2, Prob(X = 2) = 1 4, Prob(X = 3) = 1 8,..., then what s the mean of X (i.e., E[X])? Solution: Let f(x) = 1 2 x x x 3 + = 1 1 x/2 1. f (x) = x x 2 +. f (1) = = E[X]. Method of moments: Random variables X 1, X 2,... If the l th moment E[X l n] converges to that of the standard normal distribution ( l), then X n converges to a Gaussian. Standard normal distribution: 2m th moment: (2m 1)!! = (2m 1)(2m 3) 1, (2m 1) th moment: 0.
58 New Approach: Case of Fibonacci Numbers p n,k = # {N [F n, F n+1 ): the Zeckendorf decomposition of N has exactly k summands}. Recurrence relation: N [F n+1, F n+2 ): N = F n+1 + F t +, t n 1. p n+1,k+1 = p n 1,k + p n 2,k +
59 New Approach: Case of Fibonacci Numbers p n,k = # {N [F n, F n+1 ): the Zeckendorf decomposition of N has exactly k summands}. Recurrence relation: N [F n+1, F n+2 ): N = F n+1 + F t +, t n 1. p n+1,k+1 = p n 1,k + p n 2,k + = p n 2,k + p n 3,k + p n,k+1
60 New Approach: Case of Fibonacci Numbers p n,k = # {N [F n, F n+1 ): the Zeckendorf decomposition of N has exactly k summands}. Recurrence relation: N [F n+1, F n+2 ): N = F n+1 + F t +, t n 1. p n+1,k+1 = p n 1,k + p n 2,k + = p n 2,k + p n 3,k + p n,k+1 p n+1,k+1 = p n,k+1 + p n 1,k.
61 New Approach: Case of Fibonacci Numbers p n,k = # {N [F n, F n+1 ): the Zeckendorf decomposition of N has exactly k summands}. Recurrence relation: N [F n+1, F n+2 ): N = F n+1 + F t +, t n 1. p n+1,k+1 = p n 1,k + p n 2,k + = p n 2,k + p n 3,k + p n,k+1 p n+1,k+1 = p n,k+1 + p n 1,k. Generating function: p n,kx k y n y = n,k>0 1 y xy 2. Partial fraction expansion: ( ) y 1 y xy 2 = y 1 y 1 (x) y 2 (x) y y 1 (x) 1 y y 2 (x), where y1 (x) and y 2 (x) are the roots of 1 y xy 2 = 0. Coefficient of y n : g(x) = n,k>0 p n,kx k.
62 New Approach: Case of Fibonacci Numbers (Continued) K n : the corresponding random variable associated with k. g(x) = n,k>0 p n,kx k. Differentiating identities: g(1) = n,k>0 p n,k = F n+1 F n, g (x) = n,k>0 kp n,kx k 1, g (1) = g(1)e[k n ], (xg (x)) = n,k>0 k 2 p n,k x k 1, (xg (x)) x=1 = g(1)e[k 2 n], ( x (xg (x)) ) x=1 = g(1)e[k 3 n],... Similar results hold for the centralized K n : K n = K n E[K n ]. Method of moments (for normalized K n ): E[(K n )2m ]/(SD(K n ))2m (2m 1)!!, E[(K n )2m 1 ]/(SD(K n ))2m 1 0. K n Gaussian.
63 New Approach: General Case Let p n,k = # {N [H n, H n+1 ): the generalized Zeckendorf decomposition of N has exactly k summands}. Recurrence relation: Fibonacci: p n+1,k+1 = p n,k+1 + p n,k. sm+1 1 j=s m p n m,k j. General: p n+1,k = L 1 m=0 where s 0 = 0, s m = c 1 + c 2 + +c m. Generating function: Fibonacci: y 1 y xy 2. General: n L p n,kx k y n L 1 m=0 1 L 1 m=0 sm+1 1 j=s m x j y m+1 n<l m p n,kx k y n sm+1. 1 j=s m x j y m+1
64 New Approach: General Case (Continued) Partial fraction expansion: ( y Fibonacci: y 1 (x) y 2 (x) General: 1 sl 1 j=s L 1 x j i=1 B(x, y) = n L p n,k x k y n 1 y y 1 (x) 1 y y 2 (x) ). L B(x, y) (y y i (x)) ( j =i yj (x) y i (x) ). L 1 m=0 s m+1 1 j=s m x j y m+1 n<l m y i (x): root of 1 L 1 sm+1 1 m=0 j=s m x j y m+1 = 0. Coefficient of y n : g(x) = n,k>0 p n,kx k. Differentiating identities Method of moments K n Gaussian. p n,k x k y n,
65 Future Research
66 Further Research 1 Are there similar results for linearly recursive sequences with arbitrary integer coefficients (i.e. negative coefficients are allowed in the defining relation)? 2 Lekkerkerker s theorem, and the Gaussian extension, are for the behavior in intervals [F n, F n+1 ). Do the limits exist if we consider other intervals, say [F n + g 1 (F n ), F n + g 2 (F n )) for some functions g 1 and g 2? 3 For the generalized recurrence relations, what happens if instead of looking at n i=1 a i we study n i=1 min(1, a i)? In other words, we only care about how many distinct H i s occur in the decomposition. 4 What can we say about the distribution of the gaps / largest gap between summands in the Zeckendorf decomposition? Appropriately normalized, how do they behave?
67 Appendix: Combinatorial Identities and Lekkerkerker s Theorem
68 Needed Binomial Identity Binomial identity involving Fibonacci Numbers Let F m denote the m th Fibonacci number, with F 1 = 1, F 2 = 2, F 3 = 3, F 4 = 5 and so on. Then n 1 2 ( ) n 1 k = F n 1. k k=0 Proof by induction: The base case is trivially ( verified. ) Assume our claim holds for n and show that it holds for n + 1. We may extend the sum to n 1, as n 1 k = 0 whenever k > n 1. Using the standard identity that k 2 ( ( ) ( m m m + 1 ) + l l + 1 ( and the convention that m l) = 0 if l is a negative integer, we find = l + 1 ), n ( ) n k k=0 k = = = n [( n 1 k k 1 k=0 n ( n 1 k ) + ( )] n 1 k k ) n ( ) n 1 k + k 1 k k=1 k=0 n ( ) n 2 (k 1) n ( ) n 1 k + = F n 2 + F n 1 k 1 k k=1 k=0 by the inductive assumption; noting F n 2 + F n 1 = F n completes the proof.
69 Preliminaries for Lekkerkerker s Theorem E(n) := n 1 2 k=0 ( n 1 k k k ). Average number of summands in [F n, F n+1 ) is E(n) F n Recurrence Relation for E(n) E(n)+E(n 2) = (n 2)F n 3.
70 Recurrence Relation Recurrence Relation for E(n) Proof by algebra (details later): E(n) = E(n)+E(n 2) = (n 2)F n 3. n 1 2 k=0 = (n 2) ( ) n 1 k k k n 3 2 l=0 ( n 3 l = (n 2)F n 3 E(n 2). l ) n 3 2 l=0 ( ) n 3 l l l
71 Solving Recurrence Relation Formula for E(n) (i.e., Lekkerkerker s Theorem) E(n) = nf n 1 φ O(F n 2). = n 3 2 ( 1) l (E(n 2l)+E(n 2(l+1))) l=0 n 3 2 ( 1) l (n 2 2l)F n 3 2l. l=0 Result follows from Binet s formula, the geometric series formula, and differentiating identities: m j=0 jx j = x (m+1)xm (x 1) (x m+1 1). Details later in the appendix. (x 1) 2
72 Derivation of Recurrence Relation for E(n) E(n) = = = = = n 1 2 ( ) n 1 k k k k=0 n 1 2 (n 1 k)! k k!(n 1 2k)! k=1 n 1 2 (n 2 k)! (n 1 k) (k 1)!(n 1 2k)! k=1 n 1 2 (n 3 (k 1)! (n 2 (k 1)) (k 1)!(n 3 2(k 1))! k=1 n 3 2 ( ) n 3 l (n 2 l) l l=0 n 3 2 ( n 3 l = (n 2) l l=0 = (n 2)F n 3 E(n 2), ) n 3 2 l=0 ( ) n 3 l l l which proves the claim (note we used the binomial identity to replace the sum of binomial coefficients with a Fibonacci number).
73 Formula for E(n) Formula for E(n) E(n) = nf n 1 φ O(F n 2). Proof: The proof follows from using telescoping sums to get an expression for E(n), which is then evaluated by inputting Binet s formula and differentiating identities. Explicitly, consider n 3 2 ( 1) l (E(n 2l) + E(n 2(l + 1))) = l=0 = = n 3 2 l=0 ( 1) l (n 3 2l)F n 3 2l + n 3 2 l=0 n 3 2 ( 1) l (n 3 2l)F n 3 2l + O(F n 2 ); l=0 ( 1) l (n 2 2l)F n 3 2l n 3 2 ( 1) l (2l)F n 3 2l l=0 while we could evaluate the last sum exactly, trivially estimating it suffices to obtain the main term (as we have a sum of every other Fibonacci number, the sum is at most the next Fibonacci number after the largest one in our sum).
74 Formula for E(n) (continued) We now use Binet s formula to convert the sum into a geometric series. Lettingφ = 1+ 5 be the golden mean, we 2 have F n = φ φ n 1 φ (1 φ) n 5 5 (our constants are because our counting has F 1 = 1, F 2 = 2 and so on). As 1 φ < 1, the error from dropping the (1 φ) n term is O( l n n) = O(n2 ) = o(f n 2 ), and may thus safely be absorbed in our error term. We thus find E(n) = = n 3 φ 2 (n 3 2l)( 1) l φ n 3 2l + O(F n 2 ) 5 l=0 n 3 2 n 3 2 φ n 2 5 (n 3) ( φ 2 ) l 2 l( φ 2 ) l + O(F n 2). l=0 l=0
75 75 Intro Erdos-Kac Generalizations Method Open Questions Appendix Formula for E(n) (continued) We use the geometric series formula to evaluate the first term. We drop the upper boundary term of ( φ 1 ) n 3 2, as this term is negligible since φ > 1. We may also move the 3 from the n 3 into the error term, and are left with E(n) = = φ n 2 5 n 3 2 n 1 + φ 2 2 l( φ 2 ) l + O(F n 2) l=0 φ n 2 [ ( n )] n 3 2S, φ 2 + O(F φ 2 n 2 ), 2 where S(m, x) = m jx j. j=0 There is a simple formula for S(m, x). As m j=0 x j = xm+1 1, x 1 applying the operator x d dx gives S(m, x) = m j=0 jx j = x (m + 1)xm (x 1) (x m+1 1) = mx m+2 (m + 1)x m+1 + x. (x 1) 2 (x 1) 2
76 Formula for E(n) (continued) Taking x = φ 2, we see that the contribution from this piece may safely be absorbed into the error term O(F n 2 ), leaving us with E(n) = nφ n 2 5(1 + φ 2 ) + O(F n 2) = nφ n 5(φ 2 + 1) + O(F n 2). Noting that for large n we have F n 1 = φn 5 + O(1), we finally obtain E(n) = nf n 1 φ O(F n 2).
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang http://www.williams.edu/mathematics/sjmiller/public html College of the Holy Cross,
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Olivial Beckwith, Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang http://www.williams.edu/mathematics/sjmiller/public html Colby
More informationFrom Fibonacci Numbers to Central Limit Type Theorems
From Fibonacci Numbers to Central Limit Type Theorems Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang Williams College, October 1st, 010 Introduction Previous Results Fibonacci Numbers: F n+1
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Steven J. Miller (MC 96) http://www.williams.edu/mathematics/sjmiller/public_html Yale University, April 14, 2014 Introduction Goals of the
More informationSpringboards to Mathematics: From Zombies to Zeckendorf
Springboards to Mathematics: From Zombies to Zeckendorf Steven J. Miller http://www.williams.edu/mathematics/sjmiller/public_html Zombies General Advice: What are your tools and how can they be used? Zombine
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Steven J Miller, Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller CANT 2010, CUNY, May 29, 2010 Summary
More informationWhy Cookies And M&Ms Are Good For You (Mathematically)
Why Cookies And M&Ms Are Good For You (Mathematically) Steven J. Miller, Williams College Steven.J.Miller@williams.edu http://web.williams.edu/mathematics/sjmiller/public_html/ Stuyvesant High School,
More informationDistribution of summands in generalized Zeckendorf decompositions
Distribution of summands in generalized Zeckendorf decompositions Amanda Bower (UM-Dearborn), Louis Gaudet (Yale University), Rachel Insoft (Wellesley College), Shiyu Li (Berkeley), Steven J. Miller and
More informationON THE NUMBER OF SUMMANDS IN ZECKENDORF DECOMPOSITIONS
ON THE NUMBER OF SUMMANDS IN ZECKENDORF DECOMPOSITIONS MURAT KOLOĞLU, GENE S. KOPP, STEVEN J. MILLER, AND YINGHUI WANG Abstract. Zecendorf proved that every positive integer has a unique representation
More informationMath/Stat 341 and Math 433 Probability and Mathematical Modeling II: Continuous Systems
Math/Stat 341 and Math 433 Probability and Mathematical Modeling II: Continuous Systems Steven J Miller Williams College sjm1@williams.edu http://www.williams.edu/mathematics/sjmiller/public_html/341 Lawrence
More informationFROM FIBONACCI NUMBERS TO CENTRAL LIMIT TYPE THEOREMS
FROM FIBONACCI NUMBERS TO CENTRAL LIMIT TYPE THEOREMS STEVEN J. MILLER AND YINGHUI WANG Abstract A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive
More informationConvergence rates in generalized Zeckendorf decomposition problems
Convergence rates in generalized Zeckendorf decomposition problems Ray Li (ryli@andrew.cmu.edu) 1 Steven J Miller (sjm1@williams.edu) 2 Zhao Pan (zhaop@andrew.cmu.edu) 3 Huanzhong Xu (huanzhox@andrew.cmu.edu)
More informationDistribution of the Longest Gap in Positive Linear Recurrence Sequences
Distribution of the Longest Gap in Positive Linear Recurrence Sequences Shiyu Li 1, Philip Tosteson 2 Advisor: Steven J. Miller 2 1 University of California, Berkeley 2 Williams College http://www.williams.edu/mathematics/sjmiller/
More informationFrom Fibonacci Quilts to Benford s Law through Zeckendorf Decompositions
From Fibonacci Quilts to Benford s Law through Zeckendorf Decompositions Steven J. Miller (sjm1@williams.edu) http://www.williams.edu/mathematics/sjmiller/ public_html CANT 2015 (May 19), Graduate Center
More informationFrom Fibonacci Quilts to Benford s Law through Zeckendorf Decompositions
From Fibonacci Quilts to Benford s Law through Zeckendorf Decompositions Steven J. Miller (sjm1@williams.edu) http://www.williams.edu/mathematics/sjmiller/public_html AMS Special Session on Difference
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationFrom M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math.
From M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math. Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu (with Cameron and Kayla
More informationFrom M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math.
From M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math. Steven J. Miller, Williams College Steven.J.Miller@williams.edu http://web.williams.edu/mathematics/sjmiller/public_html/
More informationBinomial Coefficient Identities/Complements
Binomial Coefficient Identities/Complements CSE21 Fall 2017, Day 4 Oct 6, 2017 https://sites.google.com/a/eng.ucsd.edu/cse21-fall-2017-miles-jones/ permutation P(n,r) = n(n-1) (n-2) (n-r+1) = Terminology
More informationMath 341: Probability Eighteenth Lecture (11/12/09)
Math 341: Probability Eighteenth Lecture (11/12/09) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/341/ Bronfman Science Center Williams
More information1 Examples of Weak Induction
More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of
More informationThe Fibonacci Quilt Sequence
The Sequence Minerva Catral, Pari Ford*, Pamela Harris, Steven J. Miller, Dawn Nelson AMS Section Meeting Georgetown University March 7, 2015 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 Fibonacci sequence Theorem (
More informationMultiplying two generating functions
Generating Functions 3.3 3.6 111 Multiplying two generating functions Let A(x) = a k x k and B(x) = b k x k. k 0 k 0 What is the coefficient of x k in A(x)B(x)? Generating Functions 3.3 3.6 111 Multiplying
More informationWeek 9-10: Recurrence Relations and Generating Functions
Week 9-10: Recurrence Relations and Generating Functions April 3, 2017 1 Some number sequences An infinite sequence (or just a sequence for short is an ordered array a 0, a 1, a 2,..., a n,... of countably
More informationREPRESENTING POSITIVE INTEGERS AS A SUM OF LINEAR RECURRENCE SEQUENCES
REPRESENTING POSITIVE INTEGERS AS A SUM OF LINEAR RECURRENCE SEQUENCES NATHAN HAMLIN AND WILLIAM A. WEBB Abstract. The Zeckendorf representation, using sums of Fibonacci numbers, is widely known. Fraenkel
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationIB Mathematics HL Year 2 Unit 11: Completion of Algebra (Core Topic 1)
IB Mathematics HL Year Unit : Completion of Algebra (Core Topic ) Homewor for Unit Ex C:, 3, 4, 7; Ex D: 5, 8, 4; Ex E.: 4, 5, 9, 0, Ex E.3: (a), (b), 3, 7. Now consider these: Lesson 73 Sequences and
More informationFrom M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math.
From M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math. Cameron, Kayla and Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu http://web.williams.edu/mathematics/sjmiller/public_html
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationPhysics Sep Example A Spin System
Physics 30 7-Sep-004 4- Example A Spin System In the last lecture, we discussed the binomial distribution. Now, I would like to add a little physical content by considering a spin system. Actually this
More informationSeries Solution of Linear Ordinary Differential Equations
Series Solution of Linear Ordinary Differential Equations Department of Mathematics IIT Guwahati Aim: To study methods for determining series expansions for solutions to linear ODE with variable coefficients.
More informationAn idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim
An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the
More informationGenerating Functions
Generating Functions Karen Ge May, 07 Abstract Generating functions gives us a global perspective when we need to study a local property. We define generating functions and present its applications in
More informationAlgorithms: Background
Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.
More informationMath Assignment 11
Math 2280 - Assignment 11 Dylan Zwick Fall 2013 Section 8.1-2, 8, 13, 21, 25 Section 8.2-1, 7, 14, 17, 32 Section 8.3-1, 8, 15, 18, 24 1 Section 8.1 - Introduction and Review of Power Series 8.1.2 - Find
More informationGENERATING FUNCTIONS AND CENTRAL LIMIT THEOREMS
GENERATING FUNCTIONS AND CENTRAL LIMIT THEOREMS Michael Drmota Institute of Discrete Mathematics and Geometry Vienna University of Technology A 1040 Wien, Austria michael.drmota@tuwien.ac.at http://www.dmg.tuwien.ac.at/drmota/
More informationand the compositional inverse when it exists is A.
Lecture B jacques@ucsd.edu Notation: R denotes a ring, N denotes the set of sequences of natural numbers with finite support, is a generic element of N, is the infinite zero sequence, n 0 R[[ X]] denotes
More informationn=0 xn /n!. That is almost what we have here; the difference is that the denominator is (n + 1)! in stead of n!. So we have x n+1 n=0
DISCRETE MATHEMATICS HOMEWORK 8 SOL Undergraduate Course Chukechen Honors College Zhejiang University Fall-Winter 204 HOMEWORK 8 P496 6. Find a closed form for the generating function for the sequence
More informationZeros of Generalized Eulerian Polynomials
Zeros of Generalized Eulerian Polynomials Carla D. Savage 1 Mirkó Visontai 2 1 Department of Computer Science North Carolina State University 2 Google Inc (work done while at UPenn & KTH). Geometric and
More informationCSCE 222 Discrete Structures for Computing. Dr. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Sequences and Summations Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sequences 2 Sequences A sequence is a function from a subset of the set of
More informationMathematical Induction Assignments
1 Mathematical Induction Assignments Prove the Following using Principle of Mathematical induction 1) Prove that for any positive integer number n, n 3 + 2 n is divisible by 3 2) Prove that 1 3 + 2 3 +
More informationPhysics 6720 Introduction to Statistics April 4, 2017
Physics 6720 Introduction to Statistics April 4, 2017 1 Statistics of Counting Often an experiment yields a result that can be classified according to a set of discrete events, giving rise to an integer
More informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
More informationAlgorithmic Tools for the Asymptotics of Diagonals
Algorithmic Tools for the Asymptotics of Diagonals Bruno Salvy Inria & ENS de Lyon Lattice walks at the Interface of Algebra, Analysis and Combinatorics September 19, 2017 Asymptotics & Univariate Generating
More informationFIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)
Christopher P. French Grinnell College, Grinnell, IA 0112 (Submitted June 2004-Final Revision September 2004) ABSTRACT We prove that when n is odd, the continued fraction expansion of Fn+ begins with a
More informationLEGENDRE POLYNOMIALS AND APPLICATIONS. We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.
LEGENDRE POLYNOMIALS AND APPLICATIONS We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.. Legendre equation: series solutions The Legendre equation is
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationarxiv: v1 [math.ho] 28 Jul 2017
Generalized Fibonacci Sequences and Binet-Fibonacci Curves arxiv:1707.09151v1 [math.ho] 8 Jul 017 Merve Özvatan and Oktay K. Pashaev Department of Mathematics Izmir Institute of Technology Izmir, 35430,
More informationConditional distributions. Conditional expectation and conditional variance with respect to a variable.
Conditional distributions Conditional expectation and conditional variance with respect to a variable Probability Theory and Stochastic Processes, summer semester 07/08 80408 Conditional distributions
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationMapping the Discrete Logarithm: Talk 2
Mapping the Discrete Logarithm: Talk 2 Joshua Holden Joint work with Daniel Cloutier, Nathan Lindle (Senior Theses), Max Brugger, Christina Frederick, Andrew Hoffman, and Marcus Mace (RHIT REU) Rose-Hulman
More informationThe Degree of the Splitting Field of a Random Polynomial over a Finite Field
The Degree of the Splitting Field of a Random Polynomial over a Finite Field John D. Dixon and Daniel Panario School of Mathematics and Statistics Carleton University, Ottawa, Canada {jdixon,daniel}@math.carleton.ca
More informationSubtraction games. Chapter The Bachet game
Chapter 7 Subtraction games 7.1 The Bachet game Beginning with a positive integer, two players alternately subtract a positive integer < d. The player who gets down to 0 is the winner. There is a set of
More informationSeries of Error Terms for Rational Approximations of Irrational Numbers
2 3 47 6 23 Journal of Integer Sequences, Vol. 4 20, Article..4 Series of Error Terms for Rational Approximations of Irrational Numbers Carsten Elsner Fachhochschule für die Wirtschaft Hannover Freundallee
More informationNotes on generating functions in automata theory
Notes on generating functions in automata theory Benjamin Steinberg December 5, 2009 Contents Introduction: Calculus can count 2 Formal power series 5 3 Rational power series 9 3. Rational power series
More informationLecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1
Random Walks and Brownian Motion Tel Aviv University Spring 011 Lecture date: May 0, 011 Lecture 9 Instructor: Ron Peled Scribe: Jonathan Hermon In today s lecture we present the Brownian motion (BM).
More informationApplications. More Counting Problems. Complexity of Algorithms
Recurrences Applications More Counting Problems Complexity of Algorithms Part I Recurrences and Binomial Coefficients Paths in a Triangle P(0, 0) P(1, 0) P(1,1) P(2, 0) P(2,1) P(2, 2) P(3, 0) P(3,1) P(3,
More informationCOMBINATORIAL COUNTING
COMBINATORIAL COUNTING Our main reference is [1, Section 3] 1 Basic counting: functions and subsets Theorem 11 (Arbitrary mapping Let N be an n-element set (it may also be empty and let M be an m-element
More informationIs Analysis Necessary?
Is Analysis Necessary? Ira M. Gessel Brandeis University Waltham, MA gessel@brandeis.edu Special Session on Algebraic and Analytic Combinatorics AMS Fall Eastern Meeting University of Connecticut, Storrs
More informationAnalytic Number Theory Solutions
Analytic Number Theory Solutions Sean Li Cornell University sxl6@cornell.edu Jan. 03 Introduction This document is a work-in-progress solution manual for Tom Apostol s Introduction to Analytic Number Theory.
More informationPart IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Theorems Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationCDM. Recurrences and Fibonacci. 20-fibonacci 2017/12/15 23:16. Terminology 4. Recurrence Equations 3. Solution and Asymptotics 6.
CDM Recurrences and Fibonacci 1 Recurrence Equations Klaus Sutner Carnegie Mellon University Second Order 20-fibonacci 2017/12/15 23:16 The Fibonacci Monoid Recurrence Equations 3 Terminology 4 We can
More informationSolving Differential Equations Using Power Series
LECTURE 25 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form (25.) y + p(x)y + q(x)y = 0 where the functions
More informationSolving Differential Equations Using Power Series
LECTURE 8 Solving Differential Equations Using Power Series We are now going to employ power series to find solutions to differential equations of the form () y + p(x)y + q(x)y = 0 where the functions
More informationEx. Here's another one. We want to prove that the sum of the cubes of the first n natural numbers is. n = n 2 (n+1) 2 /4.
Lecture One type of mathematical proof that goes everywhere is mathematical induction (tb 147). Induction is essentially used to show something is true for all iterations, i, of a sequence, where i N.
More informationRecurrence relations. Warm-up: The Fibonacci sequence
1 Recurrence relations Warm-up: The Fibonacci sequence The Fibonacci sequence is the sequence f n satisfying f 0 = 0, f 1 = 1 f n+2 = f n + f n+1 0,1,1,2,3,,8,13,21,34,,... Such an expression for a term
More informationGenerating Functions (Revised Edition)
Math 700 Fall 06 Notes Generating Functions (Revised Edition What is a generating function? An ordinary generating function for a sequence (a n n 0 is the power series A(x = a nx n. The exponential generating
More information1. (25 points) Consider the region bounded by the curves x 2 = y 3 and y = 1. (a) Sketch both curves and shade in the region. x 2 = y 3.
Test Solutions. (5 points) Consider the region bounded by the curves x = y 3 and y =. (a) Sketch both curves and shade in the region. x = y 3 y = (b) Find the area of the region above. Solution: Observing
More informationA GENERALIZATION OF ZECKENDORF S THEOREM VIA CIRCUMSCRIBED m-gons
A GENERALIZATION OF ZECKENDORF S THEOREM VIA CIRCUMSCRIBED m-gons ROBERT DORWARD, PARI L. FORD, EVA FOURAKIS, PAMELA E. HARRIS, STEVEN J. MILLER, EYVI PALSSON, AND HANNAH PAUGH Abstract. Zeckendorf s theorem
More informationRelevant sections from AMATH 351 Course Notes (Wainwright): Relevant sections from AMATH 351 Course Notes (Poulin and Ingalls):
Lecture 5 Series solutions to DEs Relevant sections from AMATH 35 Course Notes (Wainwright):.4. Relevant sections from AMATH 35 Course Notes (Poulin and Ingalls): 2.-2.3 As mentioned earlier in this course,
More informationIntegration - Past Edexcel Exam Questions
Integration - Past Edexcel Exam Questions 1. (a) Given that y = 5x 2 + 7x + 3, find i. - ii. - (b) ( 1 + 3 ) x 1 x dx. [4] 2. Question 2b - January 2005 2. The gradient of the curve C is given by The point
More informationGenerating Functions
Semester 1, 2004 Generating functions Another means of organising enumeration. Two examples we have seen already. Example 1. Binomial coefficients. Let X = {1, 2,..., n} c k = # k-element subsets of X
More informationContinued Fraction Digit Averages and Maclaurin s Inequalities
Continued Fraction Digit Averages and Maclaurin s Inequalities Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu Joint with Francesco Cellarosi, Doug Hensley and Jake
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationq-counting hypercubes in Lucas cubes
Turkish Journal of Mathematics http:// journals. tubitak. gov. tr/ math/ Research Article Turk J Math (2018) 42: 190 203 c TÜBİTAK doi:10.3906/mat-1605-2 q-counting hypercubes in Lucas cubes Elif SAYGI
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 2
MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 2. Countable Markov Chains I started Chapter 2 which talks about Markov chains with a countably infinite number of states. I did my favorite example which is on
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationMath 141: Lecture 19
Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,
More informationDIFFERENCES OF MULTIPLE FIBONACCI NUMBERS. Hannah Alpert Department of Mathematics, University of Chicago,Chicago, IL
#A57 INTEGERS 9 (2009), 745-749 DIFFERENCES OF MULTIPLE FIBONACCI NUMBERS Hannah Alpert Department of Mathematics, University of Chicago,Chicago, IL hcalpert@uchicago.edu Received: 9/11/09, Revised: 10/8/09,
More informationCombinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada
Combinatorial Enumeration Jason Z. Gao Carleton University, Ottawa, Canada Counting Combinatorial Structures We are interested in counting combinatorial (discrete) structures of a given size. For example,
More informationDiagonals: Combinatorics, Asymptotics and Computer Algebra
Diagonals: Combinatorics, Asymptotics and Computer Algebra Bruno Salvy Inria & ENS de Lyon Families of Generating Functions (a n ) 7! A(z) := X n 0 a n z n counts the number of objects of size n captures
More informationLimits and Continuity
Chapter Limits and Continuity. Limits of Sequences.. The Concept of Limit and Its Properties A sequence { } is an ordered infinite list x,x,...,,... The n-th term of the sequence is, and n is the index
More informationCombinatorial Proofs and Algebraic Proofs I
Combinatorial Proofs and Algebraic Proofs I Shailesh A Shirali Shailesh A Shirali is Director of Sahyadri School (KFI), Pune, and also Head of the Community Mathematics Centre in Rishi Valley School (AP).
More informationDistribution of Eigenvalues of Weighted, Structured Matrix Ensembles
Distribution of Eigenvalues of Weighted, Structured Matrix Ensembles Olivia Beckwith 1, Steven J. Miller 2, and Karen Shen 3 1 Harvey Mudd College 2 Williams College 3 Stanford University Joint Meetings
More informationFibonacci numbers. Chapter The Fibonacci sequence. The Fibonacci numbers F n are defined recursively by
Chapter Fibonacci numbers The Fibonacci sequence The Fibonacci numbers F n are defined recursively by F n+ = F n + F n, F 0 = 0, F = The first few Fibonacci numbers are n 0 5 6 7 8 9 0 F n 0 5 8 55 89
More informationContinuous Random Variables
1 / 24 Continuous Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay February 27, 2013 2 / 24 Continuous Random Variables
More informationAdvanced Counting Techniques. Chapter 8
Advanced Counting Techniques Chapter 8 Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence Relations Nonhomogeneous Recurrence Relations Divide-and-Conquer
More informationMatrix compositions. Emanuele Munarini. Dipartimento di Matematica Politecnico di Milano
Matrix compositions Emanuele Munarini Dipartimento di Matematica Politecnico di Milano emanuelemunarini@polimiit Joint work with Maddalena Poneti and Simone Rinaldi FPSAC 26 San Diego Motivation: L-convex
More informationDISTRIBUTION OF EIGENVALUES OF REAL SYMMETRIC PALINDROMIC TOEPLITZ MATRICES AND CIRCULANT MATRICES
DISTRIBUTION OF EIGENVALUES OF REAL SYMMETRIC PALINDROMIC TOEPLITZ MATRICES AND CIRCULANT MATRICES ADAM MASSEY, STEVEN J. MILLER, AND JOHN SINSHEIMER Abstract. Consider the ensemble of real symmetric Toeplitz
More informationPower series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0
Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can
More informationCDM. Recurrences and Fibonacci
CDM Recurrences and Fibonacci Klaus Sutner Carnegie Mellon University 20-fibonacci 2017/12/15 23:16 1 Recurrence Equations Second Order The Fibonacci Monoid Recurrence Equations 3 We can define a sequence
More informationSummation of certain infinite Fibonacci related series
arxiv:52.09033v (30 Dec 205) Summation of certain infinite Fibonacci related series Bakir Farhi Laboratoire de Mathématiques appliquées Faculté des Sciences Exactes Université de Bejaia 06000 Bejaia Algeria
More informationMath Bootcamp 2012 Miscellaneous
Math Bootcamp 202 Miscellaneous Factorial, combination and permutation The factorial of a positive integer n denoted by n!, is the product of all positive integers less than or equal to n. Define 0! =.
More informationConcrete Mathematics: A Portfolio of Problems
Texas A&M University - San Antonio Concrete Mathematics Concrete Mathematics: A Portfolio of Problems Author: Sean Zachary Roberson Supervisor: Prof. Donald Myers July, 204 Chapter : Recurrent Problems
More informationMath 341: Probability Eighth Lecture (10/6/09)
Math 341: Probability Eighth Lecture (10/6/09) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/341/ Bronfman Science Center Williams
More informationMath 0230 Calculus 2 Lectures
Math 00 Calculus Lectures Chapter 8 Series Numeration of sections corresponds to the text James Stewart, Essential Calculus, Early Transcendentals, Second edition. Section 8. Sequences A sequence is a
More informationThe Gaussian distribution
The Gaussian distribution Probability density function: A continuous probability density function, px), satisfies the following properties:. The probability that x is between two points a and b b P a
More information14.1 Finding frequent elements in stream
Chapter 14 Streaming Data Model 14.1 Finding frequent elements in stream A very useful statistics for many applications is to keep track of elements that occur more frequently. It can come in many flavours
More informationSome Thoughts on Benford s Law
Some Thoughts on Benford s Law Steven J. Miller ovember, 004 Abstract For many systems, there is a bias in the distribution of the first digits. For example, if one looks at the first digit of n in base
More information