Leonardo Pisano Fibonacci

Slides:



Advertisements
Similar presentations
By Nicole, Karen, Arthur, Nico
Advertisements

2.6 TLW apply geometric sequence.. Geometric Sequence  multiply a number to get from one term to the next.  Quotient between any term and previous is.
Introduction Geometric sequences are exponential functions that have a domain of consecutive positive integers. Geometric sequences can be represented.
ENGG2013 Unit 16 Tipping point Mar, Content How to cut a pizza Population growth model – Rabbit – Fish – Fish with harvesting kshumENGG20132.
Rabbits. Rabbits: Month 1 MonthBusy Pairs Young Pairs Total Pairs 1011.
RECURSIVE FORMULAS In addition to level 3.0 and above and beyond what was taught in class, the student may: · Make connection with other concepts.
4.7: Arithmetic sequences
Number Patterns. What are they? Number patterns are a non-ending list of numbers that follow some sort of pattern from on number to the next.
13.1 Sequences.
Note 4: Depreciation Depreciation occurs over time as the value of a commodity or object decreases. Example, the value of a new car. Diminishing Value.
Arithmetic Sequences Notes. Definitions Sequence is a set of numbers arranged in a particular order. Term is one of the set of numbers in a sequence.
FIBONACCI NUMBERS 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, ,
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Advanced Counting Techniques
SECTION 7.2 ARITHMETIC SEQUENCES. (a) 5, 9, 13, 17, 21,25 (b) 2, 2.5, 3, 3.5, 4, 4, (c) 8, 5, 2, - 1, - 4, - 7 Adding 4 Adding.5 Adding - 3 Arithmetic.
Section 7.2 Arithmetic Sequences Arithmetic Sequence Finding the nth term of an Arithmetic Sequence.
12-1 Arithmetic Sequences and Series. Sequence- A function whose domain is a set of natural numbers Arithmetic sequences: a sequences in which the terms.
Chapter 8: Sequences and Series Lesson 1: Formulas for Sequences Mrs. Parziale.
SECTION 5-5 The Fibonacci Sequence and the Golden Ratio Slide
Background Born 1170, Died 1250 in Pisa (now in Italy). Real name is Leonardo Pisano, Fibonacci is his nickname. Studied in North Africa in mathematics.
Chapter 5: Sequences, Mathematical Induction, and Recursion 5.6 Defining Sequences Recursively 1 So, Nat’ralists observe, a Flea/Hath smaller Fleas on.
11.5 = Recursion & Iteration. Arithmetic = adding (positive or negative)
Warm up – Arithmetic Sequences Identify the next three terms and the common difference for the following sequences: 1.)0, 5, 10, 15, 20… 2.)74, 67, 60,
ARITHMETIC SEQUENCES. (a) 5, 9, 13, 17, 21,25 (b) 2, 2.5, 3, 3.5, 4, 4, (c) 8, 5, 2, - 1, - 4, - 7 Adding 4 Adding.5 Adding - 3 Arithmetic Sequences.
Aim: What is the arithmetic sequence? Do Now: Find the first four terms in the sequence whose n th term is 4n + 3. HW: p.256 # 4,5,6,8,10,12,16,18,19,20.
Aim: Arithmetic Sequence Course: Alg. 2 & Trig. Do Now: Aim: What is an arithmetic sequence and series? Find the next three numbers in the sequence 1,
Patterns and Sequences
1 SS Recursion Formulas MCR3U - Santowski.
Aim: What is the geometric sequence?
Lecture 4,5 Mathematical Induction and Fibonacci Sequences.
Math 409/409G History of Mathematics The Fibonacci Sequence Part 1.
Unit 5 – Series, Sequences, and Limits Section 5.2 – Recursive Definitions Calculator Required.
Examining Fibonacci sequence right end behaviour
Sequences & Series Section 13.1 & Sequences A sequence is an ordered list of numbers, called terms. The terms are often arranged in a pattern.
Spot the Pattern Look for the pattern with the sequence of number and write the next 2 numbers in the pattern. 5, 8, 11, 14, , 10,
Recursion. The Fibonacci sequence presented in 1201 by Leonardo Fibonacci is one of the most famous. It looks like this 1, 1, 2, 3, 5, 8, 13, 21, 34,
BY: MARK WEIMER APOLLO TECHNOLOGY EDUCATION Photography & Math…. huh?
The Fibonacci Sequence. Leonardo Fibonacci (1170 – 1250) First from the West, but lots of evidence from before his time.
Geometric Sequences & Series
Inductive Reasoning  Reasoning that allows you to reach a conclusion based on a pattern of specific examples or past events.
Agenda Lecture Content:  Recurrence Relations  Solving Recurrence Relations  Iteration  Linear homogenous recurrence relation of order k with constant.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 9 The Mathematics of Spiral Growth 9.1Fibonacci’s Rabbits 9.2Fibonacci.
Fibonacci Sequence and Related Numbers
The Fibonacci Sequence
By Steven Cornell.  Was created by Leonardo Pisano Bogollo.  It show’s the growth of an idealized rabbit population.
Infinite Geometric Series Recursion & Special Sequences Definitions & Equations Writing & Solving Geometric Series Practice Problems.
Fibonacci Your homework was to find out about this man, so lets fill in this together.
Essential Questions Introduction to Sequences
7-8: RECURSIVE FORMULAS Essential Skills: Use a recursive formula to list terms in a sequence Write recursive formulas for arithmetic and geometric sequences.
Warm up A rabbit population starts with 3 rabbits and doubles every month. Write a recursive formula that models this situation. What is the number of.
Recursive Sequences Terry Anderson. What is a Recursive Sequence? A sequence that follows a pattern involving previous terms  To generate new terms,
 A mysterious illness is affecting the residents of Mexico city. DAYNUMBER OF PEOPLE INFECTED FIRST DAY8 SECOND DAY24 THIRD DAY72.
Over Lesson 7–7 5-Minute Check 1 Describe the sequence as arithmetic, geometric or neither: 1, 4, 9, 16, …? Describe the sequence as arithmetic, geometric,
Do Now Solve the inequality and come up with a real world scenario that fits the solution. Also Pick up a textbook.
“Toy” Model: Fibonacci The Fibonacci sequence first appears in the book Liber Abaci (1202) by Leonardo of Pisa, known as Fibonacci.
 Def: Exponential Function  can be written as the equation.  When b>1, we have exponential growth.  When b< 1, we have exponential decay.  a = original.
7.4 Exploring recursive sequences fibonacci
Percentages of Quantities
Patterns.
Arithmetic & Geometric Sequences
Sequences and Series.
Growth and Decay: Rational Exponents
7-8 Notes for Algebra 1 Recursive Formulas.
Good Afternoon 95.
Warm Up A petting zoo starts a population with one newborn male and one newborn female. Assuming that each adult pair will produce one male and one.
Geometric Sequences A geometric sequence is a list of numbers with a common ratio symbolized as r. This means that you can multiply by the same amount.
Write the recursive and explicit formula for the following sequence
Recursive & Explicit Processes
1×1=1 11×11= ×111= ×1111= ×11111= ×111111= × = × =
Presentation transcript:

Leonardo Pisano Fibonacci 1.3 Sequences and Recursive Formulas The Fibonacci Sequence Leonardo Pisano Fibonacci 1170 - 1250

It was first proposed by Fibonacci The Rabbit Problem It was first proposed by Fibonacci a) One pair of rabbits will reproduce after two months. b) Each pair will give birth to a male and a female. c) Rabbits will live indefinitely. d) How many pairs are there after one year?

Month Fibonacci Rabbits Pairs

The Fibonacci Sequence Add two consecutive terms to get the next term. 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, … t1 = 1, t2 = 1, tn = tn–1 + tn–2 , n > 2

The growth of certain plants 13 8 5 5 4 3 3 2 2 1 1 weeks branches

In a recursive sequence, a new term is generated from the previous term(s). Example: 3, 6, 12, 24, 48, … is a recursive sequence because each term, beginning with the second term, is the result of multiplying the previous term by two.

A recursive formula shows how to find each term from the previous term or terms. Example: Determine the first four terms… t1 = 3, t2 = – 2, tn = tn–1 + 3tn–2 , n > 2 t1 = 3 t3 = t3–1 + 3t3–2 t4 = t4–1 + 3t4–2 t2 = – 2 = t2 + 3t1 = t3 + 3t2 t3 = 7 = – 2 + 3(3) = 7 + 3(–2) = 7 t4 = 1 = 1

a) t1 = 3, tn = tn–1 + 2 b) t1 = 81, tn = tn–1 ÷ 3 Write the first five terms of each sequence. a) t1 = 3, tn = tn–1 + 2 3, 5, 7, 9, 11 b) t1 = 81, tn = tn–1 ÷ 3 81, 27, 9, 3, 1 c) t1 = 2, t2 = 4, tn = 2tn–1 + 3tn–2 2, 4, 14, 40, 122

Write a recursive formula for each sequence: t1 = 3, tn = tn–1 + 5 b) 2, – 6, 18, – 54, … t1 = 2, tn = – 3tn–1 c) 2, 4, 7, 11, 16, … t1 = 2, tn = tn–1 + n

A car worth $30 000 when it is new will depreciate by 20% per year. a) What is the car worth as a percentage of the purchase price one year after it is bought? 80% b) What is the value of the car at the end of each year for the next three years? y3 = 15360 y1 = 24000 y2 = 19200 c) Write a recursive formula for the value of the car. y1 = 24000, yn = 0.8yn–1, n > 1