Population Problems. To develop a model for population growth, To develop proficiency with algebraic equations

Similar documents
Age & Stage Structure: Elephant Model

CREATING & RUNNING A VERY SIMPLE MODEL

Solving problems by recursion

HONORS ACTIVITY #2 EXPONENTIAL GROWTH & DEVELOPING A MODEL

5 R1 The one green in the same place so either of these could be green.

In math, the rate of change is called the slope and is often described by the ratio rise

DOWNLOAD PDF BIG IDEAS MATH VERTICAL SHRINK OF A PARABOLA

Computer Science 210 Data Structures Siena College Fall Topic Notes: Recursive Methods

More About WHILE Loops

Equations and Functions, Variables and Expressions

6 Stephanie Well. It s six, because there s six towers.

Here are some of the more basic curves that we ll need to know how to do as well as limits on the parameter if they are required.

Identify recursive algorithms Write simple recursive algorithms Understand recursive function calling

Use Geometry Expressions to create and graph functions, and constrain points to functions.

Recursion continued. Programming using server Covers material done in Recitation. Part 2 Friday 8am to 4pm in CS110 lab

EXAMPLE A {(1, 2), (2, 4), (3, 6), (4, 8)}

Difference Between Dates Case Study 2002 M. J. Clancy and M. C. Linn

Starting Boolean Algebra

Objective- Students will be able to use the Order of Operations to evaluate algebraic expressions. Evaluating Algebraic Expressions

by Kevin M. Chevalier

GAP CLOSING. Grade 9. Facilitator s Guide

CSC236 Week 4. Larry Zhang

CS3 Midterm 1 Fall 2006

CS3 Midterm 1 Fall 2007 Standards and solutions

MIT AITI Python Software Development

Congruence Arithmetic

Sets. Sets. Examples. 5 2 {2, 3, 5} 2, 3 2 {2, 3, 5} 1 /2 {2, 3, 5}

Tree traversals. Review: recursion Tree traversals. October 05, 2017 Cinda Heeren / Geoffrey Tien 1

Test Bank for Privitera, Statistics for the Behavioral Sciences

(Refer Slide Time 6:48)

1 Recursion. 2 Recursive Algorithms. 2.1 Example: The Dictionary Search Problem. CSci 235 Software Design and Analysis II Introduction to Recursion

6.001 Notes: Section 4.1

Module 2 Congruence Arithmetic pages 39 54

Chapter 3: The IF Function and Table Lookup

Matrix Multiplication Studio April 20, 2007

The Anglemaker Program

2.1 System Dynamics Tool: Vensim PLE Version 6.2 Tutorial 1

Week - 03 Lecture - 18 Recursion. For the last lecture of this week, we will look at recursive functions. (Refer Slide Time: 00:05)

A-SSE.1.1, A-SSE.1.2-

Boolean algebra. June 17, Howard Huang 1

Recursion. February 02, 2018 Cinda Heeren / Geoffrey Tien 1

Table of Laplace Transforms

Chapter 2.6: Testing and running a solution

Learning Objectives: Topic Karnaugh Maps. At the end of this topic you will be able to;

GAP CLOSING. Integers. Intermediate / Senior Facilitator s Guide

Section 0.3 The Order of Operations

Section Graphs and Lines

Intro. Scheme Basics. scm> 5 5. scm>

Fibonacci numbers introduce vectors, functions and recursion. An exercise introduces graphics user interfaces.

Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5

Lecture 6: Sequential Sorting

HVRSD Standards-Based Report Card Correlations for Math. Grade 1

3.1 System Dynamics Tool: Vensim PLE Tutorial 1. Introduction to Computational Science: Modeling and Simulation for the Sciences

2.1 System Dynamics Tool: STELLA Version 10 Tutorial 1. Introduction to Computational Science: Modeling and Simulation for the Sciences, 2nd Edition

CMSC 201 Spring 2018 Project 3 Minesweeper

Learning Log Title: CHAPTER 2: FRACTIONS AND INTEGER ADDITION. Date: Lesson: Chapter 2: Fractions and Integer Addition

Hints for Exercise 4: Recursion

Order from Chaos. Nebraska Wesleyan University Mathematics Circle

Upload Your Site. & Update. How to


Teaching Quadratic Functions

Today Function. Note: If you want to retrieve the date and time that the computer is set to, use the =NOW() function.

RACKET BASICS, ORDER OF EVALUATION, RECURSION 1

Appendix 2 Number Representations

UNIVERSITY OF CALIFORNIA, SANTA CRUZ BOARD OF STUDIES IN COMPUTER ENGINEERING

Reliable programming

Dr. Scheme evaluates expressions so we will start by using the interactions window and asking Dr. Scheme to evaluate some expressions.

major differences are that the graph of a sequence is discrete and you can obtain some values of sequences using a recursive defi nition.

CSC-140 Assignment 5

Animations involving numbers

Homework 3: Recursion Due: 11:59 PM, Sep 25, 2018

Section 1.1 Definitions and Properties

My Top 5 Formulas OutofhoursAdmin

APCS-AB: Java. Recursion in Java December 12, week14 1

Computer Science Foundation Exam

COMP12111 Fundamentals of Computer Engineering Paul Nutter Vasilis Pavlidis Comments

New Jersey Core Curriculum Content Standards for Mathematics Grade 7 Alignment to Acellus

(Refer Slide Time 3:31)

1 Introduction to Using Excel Spreadsheets

Data 8 Final Review #1

Section 2.4: Arguments with Quantified Statements

Learning Excel VBA. About Variables. ComboProjects. Prepared By Daniel Lamarche

Lesson 19. Opening Discussion

Principles of Algorithm Design

Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute. Module 02 Lecture - 45 Memoization

SIMPLIFYING Judo Math Inc.

Access Intermediate

Grade 4 CCSS Pacing Guide: Math Expressions

Applied Calculus. Lab 1: An Introduction to R

6.001 Notes: Section 6.1

CIS220 In Class/Lab 1: Due Sunday night at midnight. Submit all files through Canvas (25 pts)

Lecture Notes 4 More C++ and recursion CSS 501 Data Structures and Object-Oriented Programming Professor Clark F. Olson

MITOCW ocw f99-lec12_300k

Did you ever think that a four hundred year-old spider may be why we study linear relationships today?

Using Microsoft Word. Text Tools. Spell Check

EVALUATION ONLY. In this chapter, you will learn new. Text and Analysis EXCEL 2016 CHAPTER TIMING PROJECT: ANALYZING SALES INFORMATION

Excel for Algebra 1 Lesson 5: The Solver

(Refer Slide Time: 02.06)

Teachers Teaching with Technology (Scotland) Teachers Teaching with Technology. Scotland T 3. Matrices. Teachers Teaching with Technology (Scotland)

Welcome to CS 115 (Winter 2018)

Transcription:

Grade levels: 7-12 Population Problems Objectives: To develop a model for population growth, To develop proficiency with algebraic equations Topics involved: and sequences, Modeling, algebra, systems of equations with multiple variables, recursive equations Activity length: 1-2 periods, depending on depth You may find the notes on stage models useful as a lead-in to these problems. The questions: 1. Suppose you start with a pair of bunnies (all pairs will be male/female mating pairs). If a pair of bunnies produces one pair of baby bunnies each month, and it takes baby bunnies one month to mature before they can begin to reproduce, how many bunnies will you have in a year? 2. Suppose now that a pair of bunnies produces four pairs of bunnies each month, and it takes baby bunnies two months to mature. How many bunnies will you have in a year? To clarify: Just in case it s unclear how this works, I ll step through problem 1. I start with a pair in January, let s call them pair A. They reproduce in January, producing a pair of babies (call them pair B). In February, pair A produces another pair of babies (pair C), while pair B does nothing because they re too young. In March, pair A AND pair B (now mature) produce a total of 2 pairs of babies, while pair C does nothing. Continue through December. The wrong way to do it: Most people will start by counting, taking a tally, and trying to methodically step-by-step track how many bunnies will be produced in a year. This method can work - but it s easy to get confused and difficult to keep track of which bunnies are maturing and which bunnies are adults. Not to mention how do you neatly track it all? Problem 1 is tricky enough to track these ways, problem 2 is a good way to drive your students insane. 1

Figure 1: One common approach. Each row is a month with lines drawn to show parent-offspring connection. Note that it gets messy (and frustrating) very quickly. Figure 2: Another approach. Cleaner, with total adults and offspring being calculated in each column. If done carefully, this actually works. But notice that the approach is divorced from the actual biological situation - it s just numbers in a mystical pattern. So it s easy to get confused as to what you re supposed to add at each step. A single mistake cascades and can also lead to false patterns arising. 2

A Modeling Approach: First off, note that everything is in pairs, so unlike the previous examples, let s just count pairs as our unit (ie. we ll use 1 pair instead of 2 bunnies ). That ll keep the numbers smaller. A stage model diagram might help here to capture exactly what s going on. Here s what the stage diagram will look like for problem 1. Figure 3: The stage diagram, showing Adults (A) and Juveniles (J). Juveniles mature into Adults every month. Adults produce one pair of Juveniles every month. Once you have the diagram, the equations flow naturally. Each stage gets an equation, each arrow creates a term. So we get: The number of Adults I ll have next month is the number of Adults I currently have, plus the number of Juveniles who will mature in that time (which is all of the current Juveniles). Note that Adults giving birth has no effect on the Adult population, so that arrow actually has no term associated with it. J(t + 1) = J(t) J(t) + A(t) The number of Juveniles I ll have next month is the number of Juveniles I currently have, minus the Juveniles who will mature in that time (which is all of the current Juveniles), plus the number of Juveniles who will be born in that time (which is equal to the number of current Adults). We can simplify a bit and get a pair of recursive equations: J(t + 1) = A(t) Using these equations, we can now calculate our populations. We start with A(0) = 1 (1 pair of Adult bunnies at the start) and J(0) = 0. So in January: A(1) = A(0) + J(0) = 1 + 0 = 1 J(1) = A(0) = 1 3

February: March: A(2) = A(1) + J(1) = 1 + 1 = 2 J(2) = A(1) = 1 A(3) = A(2) + J(2) = 2 + 1 = 3 J(3) = A(2) = 2 And so on. The equations make it much easier to keep track of our population. If we continued, we d find that the adult population has the following sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55,... Wait - that s the Fibonacci sequence! Careful thought of the problem should reveal why this is: My Adult population next month is equal to my current Adult population plus the number that mature, but the number that mature is equal to my Adult population from a month ago, because that s how many gave birth last month... Let s do it with math. First, a change of variable (think of it as rolling back the clock a month). The equation doesn t actually change: Now a substitution: J(t + 1) = A(t) J(t) = A(t 1) A(t + 1) = A(t) + A(t 1) That s the recursion equation for the Fibonacci sequence! This particular problem is said to have been proposed by Fibonacci and motivated the creation of this famous recursion relation. Oh yeah, so the answer. In twelve months, I ll have 233 adult pairs. Juveniles can be calculated using our equations: J(12) = A(11) = 144. So I ll have 377 pairs of bunnies, or 754 bunnies total. What about problem 2? Let s approach problem 2 in the same way. Start with a stage diagram. There are a couple ways to do it, but because of the two month maturation period, I m going to split Juveniles into two parts - Newborns and 1-month old Juveniles: Figure 4: The stage diagram, showing Adults (A), Juveniles (J), and Newborns (N). Newborns mature into Juveniles, Juveniles mature into Adults, Adults produce four pair of Juveniles every month. 4

The equations flow just as before: J(t + 1) = J(t) J(t) + N(t) = N(t) N(t + 1) = N(t) N(t) + 4A(t) = 4A(t) You could solve it using these equations, or we could do some clever simplifications again. A change of variables: J(t + 1) = N(t) J(t) = N(t 1) And now some substitutions: N(t + 1) = 4A(t) N(t 1) = 4A(t 2) A(t + 1) = A(t) + N(t 1) A(t + 1) = A(t) + 4A(t 2) So it s not quite as simple as the Fibonacci sequence, but it s still not bad. Simple arithmetic from here on out. I ll leave this one to you. Extending It: Looking at the final recursion equations for Adult populations, you might conjecture how the recursion formula will look if I said Juveniles take 3 months to mature and Adults produce 6 pair of offspring each month: A(t + 1) = A(t) + 6A(t 3) And you d be right. A general form would be A(t + 1) = A(t) + BA(t M), where B is the number of offspring pairs born each month, and M is the maturation time. For more of what a stage model can do, see the stage model notes posted on the Super-M website. If you do choose to make your model more complex, please note that simplifying the equations to a single recursion relation like we did may not be as possible. Only this particular situation allowed for easy manipulation of the equations. But you can still get solutions by using the full unsimplified system of equations. 5