FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix



Similar documents
Infinite Sequences and Series

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

Sequences and Series

Soving Recurrence Relations

Chapter 5: Inner Product Spaces

Lecture 4: Cheeger s Inequality

Asymptotic Growth of Functions

Convexity, Inequalities, and Norms

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE The absolute value of the complex number z a bi is

1 Computing the Standard Deviation of Sample Means

Section 8.3 : De Moivre s Theorem and Applications

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

S. Tanny MAT 344 Spring be the minimum number of moves required.

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

A Recursive Formula for Moments of a Binomial Distribution

Department of Computer Science, University of Otago

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

3. Greatest Common Divisor - Least Common Multiple

Lecture 5: Span, linear independence, bases, and dimension

1. MATHEMATICAL INDUCTION

1. C. The formula for the confidence interval for a population mean is: x t, which was

A probabilistic proof of a binomial identity

Theorems About Power Series

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

Properties of MLE: consistency, asymptotic normality. Fisher information.

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006

THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK

CS103X: Discrete Structures Homework 4 Solutions

4.3. The Integral and Comparison Tests

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Basic Elements of Arithmetic Sequences and Series

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

I. Chi-squared Distributions

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

SEQUENCES AND SERIES

NATIONAL SENIOR CERTIFICATE GRADE 12

How To Solve The Homewor Problem Beautifully

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).


Permutations, the Parity Theorem, and Determinants

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

Lesson 17 Pearson s Correlation Coefficient

THE ABRACADABRA PROBLEM

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Factors of sums of powers of binomial coefficients

1 Correlation and Regression Analysis

, a Wishart distribution with n -1 degrees of freedom and scale matrix.

Elementary Theory of Russian Roulette

Overview of some probability distributions.

Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

Section 11.3: The Integral Test

On Formula to Compute Primes. and the n th Prime

NATIONAL SENIOR CERTIFICATE GRADE 11


Confidence Intervals for One Mean

Measures of Spread and Boxplots Discrete Math, Section 9.4

The Stable Marriage Problem

Math C067 Sampling Distributions

Chapter 7 Methods of Finding Estimators

5.3. Generalized Permutations and Combinations

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Hypothesis testing. Null and alternative hypotheses

Normal Distribution.

MATHEMATICS P1 COMMON TEST JUNE 2014 NATIONAL SENIOR CERTIFICATE GRADE 12

PART TWO. Measure, Integration, and Differentiation

Class Meeting # 16: The Fourier Transform on R n

A Note on Sums of Greatest (Least) Prime Factors

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

5 Boolean Decision Trees (February 11)

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

BINOMIAL EXPANSIONS In this section. Some Examples. Obtaining the Coefficients

THE HEIGHT OF q-binary SEARCH TREES

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:

Output Analysis (2, Chapters 10 &11 Law)

5: Introduction to Estimation

Sampling Distribution And Central Limit Theorem

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means)

CURIOUS MATHEMATICS FOR FUN AND JOY

SEQUENCES AND SERIES CHAPTER

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Analysis Notes (only a draft, and the first one!)

Solutions to Exercises Chapter 4: Recurrence relations and generating functions

A Constant-Factor Approximation Algorithm for the Link Building Problem

2-3 The Remainder and Factor Theorems

Maximum Likelihood Estimators.

Overview on S-Box Design Principles

Incremental calculation of weighted mean and variance

Multiple Representations for Pattern Exploration with the Graphing Calculator and Manipulatives

Chapter System of Equations

Inference on Proportion. Chapter 8 Tests of Statistical Hypotheses. Sampling Distribution of Sample Proportion. Confidence Interval

Transcription:

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if there is a o-sigular matrix S of the same size such that the matrix S AS is diagoal. That meas all etries of S AS except possibly diagoal etries are zeros. The umbers which show up o the diagoal of S AS are the eigevalues of A. For a diagoal matrix, it is very easy to calculate its powers. Propositio. Let A a diagaalizable matrix of size m m, ad assume that λ 0... 0 0 λ... 0 S AS 0 0... λ m for a o-sigular matrix S. The for a iteger 0 A S λ 0... 0 0 λ... 0 0 0... λ m S. Proof. Deote the diagoal matrix by λ 0... 0 0 λ... 0 Λ, 0 0... λ m ad observe that, sice it is very easy to multiply diagoal matrices, we have λ 0... 0 0 λ... 0 ) Λ 0 0... λ m

At the same time sice Λ S AS, we fid that Λ S AS) S AS S AS... S AS S A S because of the obvious cacellatios. We thus coclude that A SΛ S, ad the required idetity follows from ).. Fiboacci umbers ad Kepler s observatio The sequece of Fiboacci umbers F 0,,,, 3,, 8, 3,, 34,, 89, 44,... is defied recursively as follows. Oe begis with F 0 0, ad F. After that every umber is defied to be sum of its two predecessors: F F + F for. The sequece of Fiboacci umbers attract certai iterest for various reasos see, for istace, http://e.wikipedia.org/wiki/fiboacci_umber ). I particular, Johaes Kepler 7 630), oe of the greatest astroomers i the history, observed that the ratio of cosecutive Fiboacci umbers coverges to the golde ratio. Theorem Kepler). F + lim + F I this ote, we make use of liear algebra i order to fid a explicit formula for Fiboacci umbers, ad derive Kepler s observatio from this formula. More specifically, we will prove the followig statemet. Propositio. For F + ) ). We ow show how to derive Kepler s observatio from Propositio. Proof of Kepler s observatio. We simply calculate the limit as follows:

3 sice F + lim F as soo as + ) + ) + lim + lim + ) + ) + + ) ) ) ) + ) lim lim + + ) + 0 + <. + ) ) ) + The rest of the ote is devoted to the proof of Propositio with the help of Liear Algebra, ad Propositio i particular. 3. Liear Algebra iterpretatio of Fiboacci umbers Let L be the liear operator o R represeted by the matrix A 0 with respect to the stadard basis of R. For ay vector v x, y) T, we have that x x + y Lv). 0) y x I particular, for the vector u k whose coordiates are two cosecutive Fiboacci umbers F k, F k ) T, we have that Fk Fk Fk + F Lu k ) A k Fk+ u F k 0 F k F k F k+. k Thus we ca produce a vector whose coordiates are two cosecutive Fiboacci umbers by applyig L may times to the vector u with coordiates F, F 0 ) T, 0): F+ ) A F 0 Equatio is othig but a reformulatio of the defiitio of Fiboacci umbers. This equatio, however, allows us to fid a explicit formula for Fiboacci umbers as soo as we kow how to calculate the powers A of the matrix A with the help of the diagoalizatio.

4 4. Diagoalizatio of the matrix A ad proof of Propositio We begi with fidig the eigevalues of A as the roots of its characteristic polyomial λ pλ) deta λi) det λ 0 λ λ. We make use of the quadratic formula to fid the roots as 3) λ + ad λ, ad we coclude, sice the two eigevalues are real ad distict, that the matrix A diogaalizable. I order to diogaalize it, we eed to fid a basis which cosists of eigevectors of the liear operator L. Let us fid the eigevectors from the equatios Lv ) λ v, ad Lv ) λ v or, i coordiates with respect to the stadard basis of R, x x x x λ 0 y, ad λ y 0 y. y We solve these equatios ad fid eigevectors: x λ x, ad y y λ The trasitio matrices betwee the stadard basis ad the basis of eigevectors is thus λ λ S ad S λ λ λ λ λ λ λ λ λ λ λ λ λ λ We ca ow check that, as expected, 4) S AS λ 0. 0 λ We are ow i a positio to prove Propositio with the help of the diogaalizatio 4). Proof of Propositio. Propositio ow implies that A λ S 0 0 λ S, ad we combie this with equatio ) to obtai that F+ A λ S 0 F 0 0 λ S 0 λ λ λ 0 λ λ λ 0 λ λ 0 λ + λ + ) λ λ λ λ.

Equatig the etries of the vectors i the last formula we obtai i view of 3) that F λ λ + ) ) λ λ as claimed i Propositio. Remark. Usig the explicit formula from Propositio oe may address some other questios about Fiboacci umbers. Remark. It was Liear Algebra, specifically the diagoalizatio procedure, which allowed us to obtai the explicit formula i Propositio. This is ot the oly way to prove the formula. Remark 3. The sequece of Fiboacci is a very simple example of a sequece give by a recursive relatio. Oe may apply similar methods i order to ivestigate other sequeces give by recurrece relatios.