Fibonacci Numbers and Binet Formula (An Introduction to Number Theory)

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

Example 1: Find the 10th term and the nth term for the sequence 7, 10, 13, … . Solution: Un= U10 =
Chapter 20 Recursion.
Chapter 8 Introduction to Number Theory. 2 Contents Prime Numbers Fermats and Eulers Theorems.
Copyright © Cengage Learning. All rights reserved.
Analysis of Algorithms II
Excursions in Modern Mathematics Sixth Edition
Mathematical Treasure-hunt: Sequences
Factors, Primes & Composite Numbers
2 pt 3 pt 4 pt 5pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2pt 3 pt 4pt 5 pt 1pt 2pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4pt 5 pt 1pt Two-step linear equations Variables.
Arithmetic and Geometric Means
Prime and Composite Numbers. These are numbers that have only two factors – themselves and one. These are numbers that have only two factors – themselves.
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Discrete Math Recurrence Relations 1.
Tower of Hanoi Tower of Hanoi is a mathematical puzzle invented by a French Mathematician Edouard Lucas in The game starts by having few discs stacked.
The Tower Of Hanoi Edouard Lucas
Week 6 - Wednesday CS322.
Chapter 8 Recursion. 8.1 Recursively Defined Sequences.
Introduction to Algorithms
Chapter 2 Complex Numbers
Geometric Sequences Teacher Notes
©Evergreen Public Schools Arithmetic Sequences Recursive Rules Vocabulary : arithmetic sequence explicit form recursive form 4/11/2011.
12 October, 2014 St Joseph's College ADVANCED HIGHER REVISION 1 ADVANCED HIGHER MATHS REVISION AND FORMULAE UNIT 2.
JEOPARDY.
12.1 – Arithmetic Sequences and Series
AE1APS Algorithmic Problem Solving John Drake
Week 1.
12 System of Linear Equations Case Study
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
11.2 Arithmetic Sequences & Series
KOLAM DESIGNS BASED ON FIBONACCI NUMBERS S. Naranan 30 January 2008 Copyright: Prof. S. Naranan, Chennai, India.
11.5 Recursive Rules for Sequences p Explicit Rule A function based on a term’s position, n, in a sequence. All the rules for the nth term that.
Copyright © Cengage Learning. All rights reserved.
Lecture 2 Based on Chapter 1, Weiss. Mathematical Foundation Series and summation: ……. N = N(N+1)/2 (arithmetic series) 1 + r+ r 2 + r 3 +………r.
Copyright © Cengage Learning. All rights reserved.
Chapter 5 Number Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Geometric Sequences A geometric sequence (or geometric progression) is a sequence in which each term after the first is obtained by multiplying the preceding.
Recursion.
The Tower of Hanoi
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
13.2: Arithmetic and Geometric Sequences Recursive Definitions.
7.5 Use Recursive Rules with Sequences and Functions
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Copyright © Cengage Learning. All rights reserved.
Advanced Counting Techniques
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Sequences and Series (T) Students will know the form of an Arithmetic sequence.  Arithmetic Sequence: There exists a common difference (d) between each.
Week 6 - Monday CS322.
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
Advance Data Structure and Algorithm COSC600 Dr. Yanggon Kim Chapter 1.
Advanced Counting Techniques CSC-2259 Discrete Structures Konstantin Busch - LSU1.
13.2 Recursive Definitions Objective 1) Provide the recursive definition for sequences; 2) Identify the type of a sequence from a recursive definition.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Chapter 8 With Question/Answer Animations. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Advanced Counting Techniques CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Examining Fibonacci sequence right end behaviour
Chapter 6.1: Recurrence Relations Discrete Mathematical Structures: Theory and Applications.
Algebra II Chapter : Use Recursive Rules with Sequences and Functions HW: p (4, 10, 14, 18, 20, 34)
Infinite Geometric Series Recursion & Special Sequences Definitions & Equations Writing & Solving Geometric Series Practice Problems.
Essential Questions Introduction to Sequences
 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.
 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.
{1, 1, 2, 3, 5, 8, 13, 21,...} What is this? Fibonacci Sequence.
Copyright © 2011 Pearson Education, Inc. Slide
Introduction to Recurrence Relations
11.3 Geometric sequences; Geometric Series
Chapter 11: Further Topics in Algebra
8.5 Using Recursive Rules with Sequences
Presentation transcript:

Fibonacci Numbers and Binet Formula (An Introduction to Number Theory) By: (The Ladies) 2

Recurrence Sequence each further term of the sequence is defined as a function of the preceding terms (starting seed and rule) Fibonacci sequence (1,1,2,3,5,8,13,21,34,55...) Lucas sequence (2,1,3,4,7,11,18,29,47,76) take 3+8 (1+2)+(3+5) (1+3)+(2+5) (4)+(7) - can be shown to hold in general

Mathematical induction Fibonacci (1,1,2,3,5,8,13...) 1,1+1,1+1+2,1+1+2+3,1+1+2+3+5,1+1+2+3+5+8... 1,2,4,7,12,20... +1 to each term 2,3,5,8,13,21... because 1+1+2+3+5+8 1+1+1+2+3+5+8 (2+1)+2+3+5+8 (3+2)+3+5+8 (5+3)+5+8 (8+5)+8 (13+8)

Fibonacci sequence patterns neither arithmetic nor geometric so write it in a different way 1/1=1 2/1=(1+1)/1 = (1+(1/1)) 3/2=(2+1)/2=1+(1/2)= 1+ 1/(1+(1/1)) 5/3=(3+2)/3=1+(2/3)=1+ 1/(1+ 1/(1+(1/1))) and so on (Golden ratio φ)

Golden Ratio φ φ=1+1/φ φ2=φ+1 quadratic equation φ=(1+sqrt(5))/2 (only the positive answer) φ=1.618033989...

Golden Ratio and practical application most famous and controversial in history - human aesthetics Converting between km and miles 1 mile= 1.6093 km 13 km = 8 miles Fibonacci (1,1,2,3,5,8,13,21...) OK, using Fibonacci numbers, how many miles are in 50 kilometers?? (show your work)

Binet Formula A formula to find a term in a Fibonacci numbers without generating previous terms Jacques Binet in 1843 - known to Euler and Bernoulli 100 years before Fibonacci numbers are actually a combo of two geometric progressions Recall φ2=φ+1 and τ2=τ+1 identities Use them to come up with a formula for the Fibonacci series

Binet Formula φ2=φ+1 and τ2=τ+1 identities φ2= φ+1 φ3=φ(φ2)=φ(φ+1)=(φ2)+φ=(φ+1)+φ= 2φ+1 φ4=φ(φ3)=φ(2φ+1)=(2φ2)+φ=2(φ+1)+φ= 3φ+2 φ5=φ(φ4)=φ(3φ+2)=(3φ2)+2φ=3(φ+1)+2φ= 5φ+3 φ6=φ(φ5)=φ(5φ+3)=(5φ2)+3φ=5(φ+1)+3φ= 8φ+5 φ2=1φ+1 So, φn=Fnφ+Fn-1 φ3=2φ+1 and φ4=3φ+2 τn=Fnτ+Fn-1 φ5=5φ+3 φ6=8φ+5

Binet Formula Fn= (φ^n - τ^n) / (φ - τ) φ^n=Fnφ+Fn-1 τ^n=Fnτ+Fn-1 remember that φ = (1+sqrt(5))/2 and τ = (1+sqrt(5))/2 therefore (φ - τ) = sqrt (5) Fn= (φ^n - τ^n) / sqrt(5) Fn=(φ^n/sqrt(5)) - (τ^n/sqrt(5)) (two geometric progressions) now for the Fibonacci term 1000 is F1000= (φ^(10000) - τ^(10000)) / sqrt(5) = 43466557686937456... (209 digits)

The Fibonacci Sequence in Nature http://www.youtube.com/watch?v=ahXIMUkSX X0

Application : The Towers of Hanoi

The Rules: From here: To here: Without: 1. Moving more than one disk at a time. 2. Placing a larger disk on top of a smaller disk.

An Example: 1 2 3 4 5 6 7

hn = # of moves required to transfer n disks. The Goal: To find the minimum number of moves necessary to complete the puzzle. hn = # of moves required to transfer n disks. Let us find a recurrence rule to predict hn.

h3 = 7 h5 = 31 h7 = 123 h4 = 15 h6 = 63 h8 = 247 What We Know: hn = small disks + big disk + small disks hn-1 + 1 + hn-1 2hn-1 + 1 Recursive Formula: hn= 2hn-1+ 1

Closed Formula: 3, 7, 15, 31, 63, ... One less than a power of 2? 3 = 22 - 1 7 = 23 - 1 15 = 24 - 1 hn = 2n -1

Prediction : End of the World? High on the mountaintops sat a monk who could foretell the end of the world. He had a Tower of Hanoi with 64 gleaming diamond disks and could move one a second. When he stopped the world would end. How long do we have?

Prediction : Solution Number of moves required 264 -1 So . . . roughly 583,344,214,028 years.

Prime Numbers: How do we find them? 200 B.C. Eratosthenes invented the sieve.

Prime Numbers:

Prime Numbers:

Prime Numbers:

Prime Numbers:

Prime Numbers: And it stops.

Why? The number of tests is the # of primes < testing maximum Proof by contradiction: 1. A composite exists in 11-100 2. Thus, it is not a multiple of a P < 10 3. Thus, both factors > 10 4. Therefore, the composite > 100

Prime Numbers: How many exist? E = P1 * P2 * P3 * P4 ... Pn now... q = P1 * P2 * P3 * P4 * ... * Pn + 1 Following the Composite Theorems (must be factor of unique prime numbers), infinite prime numbers exist.

Where Aren't the Prime Numbers? 2*3 + 2 = composite 2*3 + 3 = composite K = 2 * 3 * 4 * ... * (N+1) K+2 = 2 * 3 * 4 * ... * (N+1) +2 K+3 = 2 * 3 * 4 * ... * (N+1) + 3 K+(N+1) = 2 * 3 * 4 * ... * (N+1) + (N+1) K+2, K+3, K+4, K+(N+1) --> all composite, there are runs infinitely long where there are no primes.