Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

Slides:



Advertisements
Similar presentations
Week 6 - Wednesday CS322.
Advertisements

Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
CSE115/ENGR160 Discrete Mathematics 04/19/12 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 04/21/11 Ming-Hsuan Yang UC Merced 1.
Discrete Structures Chapter 6 Recurrence Relations
Kavita Hatwal Fall Sequences and Induction.
Recursion.
Chapter 7 Review. Simplify, no negative exponents.
1 Sequences and Mathematical Induction An important task of mathematics is to discover and characterize regular patterns, such as those associated with.
Discrete Structures Chapter 5: Sequences, Mathematical Induction, and Recursion 5.7 Solving Recurrence Relations by Iteration The keener one’s sense of.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Copyright © Cengage Learning. All rights reserved.
Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Applied Discrete Mathematics Week 9: Relations
Introduction to sequences and series A sequence is a listing of numbers. For example, 2, 4, 6, 8,... or 1, 3, 5,... are the sequences of even positive.
Fall 2015 COMP 2300 Discrete Structures for Computation
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
13.2 Recursive Definitions Objective 1) Provide the recursive definition for sequences; 2) Identify the type of a sequence from a recursive definition.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
CSE 2813 Discrete Structures Recurrence Relations Section 6.1.
RECURRENCE Sequence Recursively defined sequence
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Sequences and Summations
Algebra Geometric Sequences Objectives of this Section Determine if a Sequence Is Geometric Find a Formula for a Geometric Sequence Find the Sum.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Series and Sequences An infinite sequence is an unending list of numbers that follow a pattern. The terms of the sequence are written a1, a2, a3,...,an,...
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Sequences and Summations Section 2.4. Section Summary Sequences. – Examples: Geometric Progression, Arithmetic Progression Recurrence Relations – Example:
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
1 Topics Recursion sections 8.1 – Recursion A recursively defined sequence –First, certain initial values are specified –Later terms of the sequence.
Warm - Up A = d(1+r a )[(1+r a ) nt – 1] r a If you deposit $50 every quarter in an account that pays 5% interest compounded quarterly what will your balance.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Spring 2016 COMP 2300 Discrete Structures for Computation
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
RECURRENCE Sequence Recursively defined sequence
1 2/21/2016 MATH 224 – Discrete Mathematics Sequences and Sums A sequence of the form ar 0, ar 1, ar 2, ar 3, ar 4, …, ar n, is called a geometric sequence.
Warm - Up A = d(1+r a )[(1+r a ) nt – 1] r a If you deposit $50 every quarter in an account that pays 5% interest compounded quarterly what will your balance.
Sequences and the Binomial Theorem Sequences Arithmetic Sequences Geometric Sequences & Series Binomial Theorem.
1 RECURRENCE 1. Sequence 2. Recursively defined sequence 3. Finding an explicit formula for recurrence relation.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
CMSC Discrete Structures
Arithmetic and Geometric sequence and series
Discrete Mathematics Lecture#14.
Arithmetic & Geometric Sequences
Sequences and Series College Algebra
Use mathematical induction to prove that the formula is true for all natural numbers m. {image} Choose the first step of the proof from the following:
Discrete Math (2) Haiming Chen Associate Professor, PhD
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
CMSC Discrete Structures
Applied Discrete Mathematics Week 7: Computation
CMSC Discrete Structures
Recurrence Relations Discrete Structures.
Module 3 Arithmetic and Geometric Sequences
Write the recursive and explicit formula for the following sequence
Recurrence Relations.
Module 3 Arithmetic and Geometric Sequences
ICS 253: Discrete Structures I
1.6 Geometric Sequences Geometric sequence: a sequence in which terms are found by multiplying a preceding term by a nonzero constant.
Presentation transcript:

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 5.7 Solving Recurrence Relations by Iteration

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Sequences Informally, A set of elements written in a row and demonstrate some pattern (i.e. 1, 3, 5, 7, 9) In the sequence denoted, each individual elements is called a term. in is called a subscript or index, is the subscript of the initial term, is the subscript of the final term. 2

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University How to Express a Sequence? Write the first few terms with the expectation that the general pattern will be obvious i.e. “consider the sequence 3, 5, 7, 9 …” Misunderstandings can occur Give an explicit formula for it th term, i.e. By recursion which requires a recurrence relation. 3 for all integers (Initial term) (recursive relation)

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University How to Get an Explicit Formula? It is often helpful to know an explicit formula for the sequence Faster computation Proof of a theory Such explicit formula is called a solution to the recurrence relation The method of iteration The most basic method for finding an explicit formula Given a sequence defined by a recurrence relation and initial conditions, start from the initial conditions and calculate successive terms until you see a pattern 4

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example Tips Leave most of the arithmetic undone Eliminate parentheses as you go from one step to the next 5 Q: What is the explicit formula?

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example – cont’ 6

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Explicit Formula for a Geometric Sequence Let be a fixed nonzero constant Suppose a sequence is defined recursively as follows: The sequence above is called a “Geometric Sequence”. What is the explicit formula for this sequence? 7

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Explicit Formula for a Geometric Sequence Let be a fixed nonzero constant Suppose a sequence is defined recursively as follows: 8

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Two Famous Solutions for all integers 9

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Two Famous Solutions If is even If is odd 10

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Explicit Formula for Tower of Hannoi Sequence 11

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Checking the Correctness of a Formula by Mathematical Induction We have My solution: Mathematical Induction 12

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Discovering That at Explicit Formula Is Incorrect We have My solution: Mathematical Induction 13

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Some Examples Ex 11. Ex

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Some Examples A bank pays interest at a rate of 6% per year compounded annually. An denotes the amount in the account at the end of year, then for. Assume no deposit or withdrawals during the year. Initial amount deposited is $150,000 Q1) How much will the account be worth at the end of 31 years? Q2) In how many years will the account be worth $2,000,000? 15