“Many pre-calculus concepts can be taught from a discrete dynamical systems viewpoint. This approach permits the teacher to cover exciting applications.

Slides:



Advertisements
Similar presentations
Week 6 - Wednesday CS322.
Advertisements

Many pre-calculus concepts can be taught from a discrete dynamical systems viewpoint. This approach permits the teacher to cover exciting applications.
© The University of Texas at El Paso Two First Year Seminar Course Designs for Science and Mathematics Majors Helmut Knaust Department of Mathematical.
259 Lecture 7 Spring 2015 Population Models in Excel.
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
Recursion Lecture 17: Nov 11. Quiz int hello(int n) { if (n==0) return 0; else printf(“Hello World %d\n”,n); hello(n-1); } 1.What would the program do.
Chapter 5: Sequences & Discrete Difference Equations 1.(5.1) Sequences 2.(5.2) Limit of a Sequence 3.(5.3) Discrete Difference Equations 4.(5.4) Geometric.
Logarithmic and Exponential Functions
Advanced Counting Techniques
An Example in the Design and Analysis of an Algorithm Demonstrates: -- Recurrence Relations -- Design Techniques -- The fact that analysis provide useful.
Module 1 ~ Topic 1 Solving Equations Table of Contents  Slides 6-14: Solving Linear Equations  Slides : Practice Questions Audio/Video and Interactive.
1 POPULATION PROJECTIONS Session 2 - Background & first steps Ben Jarabi Population Studies & Research Institute University of Nairobi.
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
Lesson 17 – Introducing and Applying Base e. IBHL1 Math - Santowski 10/1/20151 IBHL1 - Santowski.
The Golden Ratio and Fibonacci Numbers in Nature
Block 5 Stochastic & Dynamic Systems Lesson 18 – Differential Equations - Methods and Models Charles Ebeling University of Dayton.
Integrals  In Chapter 2, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.  In much the.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Lecture 4,5 Mathematical Induction and Fibonacci Sequences.
11/23/2015 Precalculus - Lesson 21 - Exponential Models 1 Lesson 21 – Applications of Exponential Functions Precalculus.
Lesson 20 – Introducing and Applying Base e. IB Math SL1 - Santowski.
Fibonacci Фибоначи. The Fibonacci numbers form a series in mathematics, which is defined recursively as follows: F(0) = 0 F(1) = 1 F(n) = F(n-1)
Sequences and Summations ICS 6D Prof. Sandy Irani.
Announcements Topics: -Introduction to (review of) Differential Equations (Chapter 6) -Euler’s Method for Solving DEs (introduced in 6.1) -Analysis of.
Dr Nazir A. Zafar Advanced Algorithms Analysis and Design Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar.
1 College of Communication Engineering Undergraduate Course: Signals and Linear Systems Lecturer: Kunbao CAI.
INTEGRALS 5. INTEGRALS In Chapter 3, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.
Discrete Math For Computing II. Contact Information B. Prabhakaran Department of Computer Science University of Texas at Dallas Mail Station EC 31, PO.
Virtual University of Pakistan
Recurrence Relations in Excel
Chapter 3: Proportion and the Golden Ratio
Chapter 11-SOLVING EQUATIONS IN EXCEL USING GOAL SEEK
Virtual University of Pakistan
ISHIK UNIVERSITY FACULTY OF EDUCATION Mathematics Education Department
CMSC Discrete Structures
introducing Section 4: Linear Functions Topics 1-4
DIFFERENTIAL EQUATIONS
Last Time Proportions Continuous Random Variables Probabilities
Differential Equations
The Computational Method (mathematics)
Second Shifting Theorem
Linear homogeneous ODEn with constant coefficients
Section 10.1 Mathematical Modeling: Setting Up A Differential Equation
Math Linear Algebra Introduction
Linear Equations by Dr. Shorouk Ossama.
Population Models in Excel
Modeling with Recurrence Relations
Introduction to Recurrence Relations
Discrete Mathematics CS 2610
Business Mathematics MTH-367
9 The Mathematics of Spiral Growth
AP Calculus AB/BC 6.5 Logistic Growth, p. 362.
Copyright © Cengage Learning. All rights reserved.
Hidden Markov Models Part 2: Algorithms
Exponential Functions and Graphs
LESSON 64 L’HOPITAL’S RULE HL MATH - CALCULUS
Copyright © Cengage Learning. All rights reserved.
1 FUNCTIONS AND MODELS.
Copyright © Cengage Learning. All rights reserved.
CMSC Discrete Structures
Scientific Revolutions – A First Year Seminar Course Design
Lecture 2 Ordinary Differential Equations fall semester
Mathematical Explorations
Laplace Transforms Lecture-11 Additional chapters of mathematics
CMSC Discrete Structures
Biodiversity, Species Interactions, and Population Control
Recurrence Relations Discrete Structures.
Supplemental Material
Which sequence is linear? How do you know?
Presentation transcript:

“Many pre-calculus concepts can be taught from a discrete dynamical systems viewpoint. This approach permits the teacher to cover exciting applications and enrichment topics.” Helmut Knaust, Ph.D. Associate Professor Department of Mathematical Sciences University of Texas at El Paso January 7, 2003

We use Discrete Dynamical Systems (=first order difference equations) To study some classical functions seen in an algebra course To study some mathematical models in population biology

Excel spreadsheets Are the perfect tool to visualize the solutions of difference equations Reduce the amount of algebra performed by the students

I have used the ideas and materials presented in university courses (SCI 1300, SCI 1100, UNIV 1301) aimed at Students in Science and Engineering who were concurrently taking a remedial Mathematics course (Algebra I or Algebra II)

Objectives of these Courses: Strengthen the students’ mathematical and critical thinking skills Increase the students’ motivation to study mathematics by portraying mathematics as a useful tool in science and engineering Improve students’ computer skills

What I like about this material: This is “pre-calculus” in the true sense of the word - a preview of the power of differential equations A nice illustration of how to use technology in mathematics Conceptually hard, but algebraically not too challenging

Pierre-Simon Laplace (1749-1827) “The simplicity of nature is not to be measured by that of our conceptions. Infinitely varied in its effects, nature is simple only in its causes, and its economy consists in producing a great number of phenomena, often very complicated, by means of a small number of general laws.” Pierre-Simon Laplace (1749-1827)

“Difference Equation” An Introductory Example: Linear Models Converting temperature from ºC to ºF The defining ingredients: 0 ºC corresponds to 32 ºF Every 1 degree increase in ºC corresponds to a 1.8 degree increase in ºF “Initial Data” “Difference Equation”

f(0)=32 f(c+1)-f(c) = 1.8 f(c+1) = f(c) + 1.8 (c = degrees Celsius, f = degrees Fahrenheit) Initial Data: f(0)=32 Difference Equation: f(c+1)-f(c) = 1.8 f(c+1) = f(c) + 1.8

c f 32.0 1 33.8 2 35.6 3 37.4 4 39.2 5 41.0 6 42.8 7 44.6 8 46.4 Initial Data f(5) = f(4)+1.8 = 39.2+1.8 = 41.0

Linear Models c f 32.0 1 33.8 2 35.6 3 37.4 4 39.2 5 41.0 6 42.8 7 44.6 8 46.4 Data on the left are in “arithmetic progression” (= constant differences between consecutive terms) Data on the right are in “arithmetic progression” (= constant differences between consecutive terms)

Exponential Models: Population Growth “The change in population from one year to the next is proportional to the present population” Difference Equation: P(n+1) - P(n) = k P(n) (P = population at time n, n = time (in years)) The change in population from one year to the next… …is proportional to… …to the present population

Exponential Models P(n+1) - P(n) = k P(n) P(n+1) = (1+k) P(n) Spreadsheet

Exponential Models: Population Growth P(n) 5000 1 5500 2 6050 3 6655 4 7321 5 8053 6 8858 7 9744 8 10718 Data on the left are in “arithmetic progression” (= constant differences between consecutive terms) Data on the right are in “geometric progression” (= constant ratios between consecutive terms)

Student Activity Fill in the missing data in the table on the right such that the y-data are in geometric progression: x y 0.0 1.000 0.5 1.0 2.000 1.5 2.0 4.000 2.5 3.0 8.000

First Historical Aside: The Babylonian Algorithm Compute approximations for the square root of 2. Take as a first guess x(0)=1. x(0)=1 is too small, since 12 < 2; consequently 2/x(0)=2 is too big; try their average next: x(1)=1/2 [ x(0) + 2/(x(0) ]=1.5

First Historical Aside: The Babylonian Algorithm This leads to the recurrence relation x(n+1)=1/2 [ x(n) + 2/x(n) ]

First Historical Aside: The Babylonian Algorithm x(n) x(n)2 1.000000000000 1 1.500000000000 2.250000000000 2 1.416666666667 2.006944444444 3 1.414215686275 2.000006007305 4 1.414213562375 2.000000000005 5 1.414213562373 2.000000000000

Second Historical Aside: Fibonacci Numbers Leonardo of Pisa, better known as Fibonacci, might have been the first to propose a model for population growth. In 1202 he proposed the following model for an imaginary rabbit population.

Second Historical Aside: Fibonacci Numbers We start with one pair of rabbits (one female and one male) that matures to reproductive age in a fixed period of time, say a month. At that time they produce a new pair, one female and one male. The original pair will reproduce one more time, after one more month, and again the offspring will be a pair of rabbits. In the sequel, each pair of rabbits will reproduce twice, at intervals separated by a month, and at each reproduction, the new pair will go on in a similar fashion. All of the reproduction happens at the same time, and each pair reproduces exactly twice.

Second Historical Aside: Fibonacci Numbers We can model Fibonacci’s model as follows: Let R(t) be the number of rabbit pairs that are born at the beginning of the t’th month. The first pair appears at time t = 0. R(0) = 1 This first pair bears another pair at time t = 1. R(1) = 1 It follows from the description above that for all later times R(t) = R(t-1) + R (t-2).

Second Historical Aside: Fibonacci Numbers R(n) R(n)/R(n-1) 1 11 144 1.6179775 1.0000000 12 233 1.6180556 2 2.0000000 13 377 1.6180258 3 1.5000000 14 610 1.6180371 4 5 1.6666667 15 987 1.6180328 8 1.6000000 16 1597 1.6180344 6 1.6250000 17 2584 1.6180338 7 21 1.6153846 18 4181 1.6180341 34 1.6190476 19 6765 1.6180340 9 55 1.6176471 20 10946 10 89 1.6181818 17711

Second Historical Aside: Fibonacci Numbers Cheating, by assuming that the ratio r of consecutive terms is eventually constant, we can compute r: r = R(n+2)/R(n+1) = R(n+1)/R(n) Using R(n+2)=R(n+1)+R(n), we obtain r = 1 + 1/r, i.e. r2 – r – 1 = 0 Solving for r yields the “Golden Ratio” as the positive solution:

Modeling with Difference Equations: Logistic Growth Population growth with limited resources Introducing the concept of a population ceiling N If the population is much smaller than N, growth should be “exponential” If the population is close to N, growth should be close to 0 If population exceeds N, growth should be negative

Modeling with Difference Equations: Logistic Growth Spreadsheet

Modeling with Difference Equations: Predator-Prey-Model

Modeling with Difference Equations: Predator-Prey-Model

Modeling with Difference Equations: Predator-Prey-Model Spreadsheet (a, b, c, d and N are positive constants)

All Questions Answered, All Answers Questioned* Contact: helmut@math.utep.edu Web: http://www.math.utep.edu/Faculty/helmut *Borrowed from D. Knuth