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.
Fall 2002CMSC Discrete Structures1 Now it’s Time for… RecurrenceRelations.
Discrete Mathematics Lecture 8 Alexander Bukharovich New York University.
Chapter 2: Second-Order Differential Equations
Week 5 - Friday.  What did we talk about last time?  Sequences  Summation and production notation  Proof by induction.
CSE115/ENGR160 Discrete Mathematics 04/19/12 Ming-Hsuan Yang UC Merced 1.
A second order ordinary differential equation has the general form
Discrete Structures Chapter 6 Recurrence Relations
Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
1 Linear Recurrence Relations Part I Jorge Cobb The University of Texas at Dallas.
Applied Discrete Mathematics Week 9: Relations
7.2 Solving Recurrence Relations. Definition 1 (p. 460)- LHRR-K Def: A linear homogeneous recurrence relations of degree k with constant coefficients.
Advanced Counting Techniques
Fall 2015 COMP 2300 Discrete Structures for Computation
Chapter 6 Mathematical Induction
Introduction to Proofs
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Advanced Counting Techniques CSC-2259 Discrete Structures Konstantin Busch - LSU1.
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.
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
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.
Recurrence Relation. Outline  What is a recurrence relation ?  Solving linear recurrence relations  Divide-and-conquer algorithms and recurrence relations.
Solving Second-Order Recursive Relations Lecture 36 ½ Section 8.3 Wed, Apr 19, 2006.
RECURRENCE Sequence Recursively defined sequence
Foundations of Discrete Mathematics Chapters 5 By Dr. Dalia M. Gil, Ph.D.
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.
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Module #1 - Logic 1 Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank and Modified By Mingwu Chen Recurrence.
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.
Advanced Counting Techniques CSC-2259 Discrete Structures Konstantin Busch - LSU1.
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.
Week 6 - Friday.  What did we talk about last time?  Solving recurrence relations.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Chapter 8 Recursion. 8.3 More Recurrence Second-Order Recurrence Definition – A second-order linear homogeneous recurrence relation with constant coefficients.
Foundations of Discrete Mathematics Chapters 5 By Dr. Dalia M. Gil, Ph.D.
7.2 Solving Linear Recurrence Relations Some of these recurrence relations can be solved using iteration or some other ad hoc technique. However, one important.
CSE 2813 Discrete Structures Solving Recurrence Relations Section 6.2.
Agenda Lecture Content:  Recurrence Relations  Solving Recurrence Relations  Iteration  Linear homogenous recurrence relation of order k with constant.
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.
RECURRENCE Sequence Recursively defined sequence
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
1 Chapter 5 DIFFERENCE EQUATIONS. 2 WHAT IS A DIFFERENCE EQUATION? A Difference Equation is a relation between the values y k of a function defined on.
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.
Solving Linear Homogeneous Recurrence Relations ICS 6D Sandy Irani.
Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar Dr Nazir A. Zafar Advanced Algorithms Analysis and Design.
Discrete Math For Computing II. Contact Information B. Prabhakaran Department of Computer Science University of Texas at Dallas Mail Station EC 31, PO.
Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar Dr Nazir A. Zafar Advanced Algorithms Analysis and Design.
CMSC Discrete Structures
Chapter 2 Planes and Lines
Modeling with Recurrence Relations
Descartes Rule of Signs Positive real zeros = Negative real zeros =
CMSC Discrete Structures
Solving Recurrence Relations
CMSC Discrete Structures
Copyright © Cengage Learning. All rights reserved.
Recurrence Relations Discrete Structures.
ICS 253: Discrete Structures I
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.8 Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University How to Find an Explicit Formula? Iteration is a basic technique, and thus limited. A second-order linear homogeneous recurrence relation with constant coefficients is a recurrence relation of the form for all integer some fixed integer, where A and B are fixed real numbers with 2

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Terms A second-order linear homogeneous recurrence relation with constant coefficients? Second-order refers to the fact that the expression for contains the two previous terms Linear to the fact that and appear in separate terms (Non-linear: ) Homogeneous to the fact that the total degree of each term is the same Constant coefficients to the fact that A and B are fixed real numbers which do not depend on k 3

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University A Simple Test 4 Non second- order Non linear Non homogeneous Non constant coefficients

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Logic (from Chapter 2) How to show two statements are equivalent? Suppose we want to prove “ A is true if and only if B is true.” First, show B is true given that A is true: Second, show A is true given that B is true: Then, A and B are equivalent! Examples 3 k = 6 if and only if k = 2 4 k = 8 if and only if ( k -2)( k -3) = 0 5

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Lemma and Characteristic Equation Let A and B be real numbers. A recurrence relation of the form (a second-order linear homogenous recurrence relation with constant coefficients) is satisfied by the sequence where t is a nonzero real number, if and only if t satisfies the equation 6 : the characteristic equation of the relation.

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Lemma and Characteristic Equation Suppose is satisfied by the sequence where t is a nonzero real number. Then, we have 7

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Lemma and Characteristic Equation If a non-zero real number t satisfies the equation then we have Now, suppose. Then, we have That is satisfies the recurrence relation. 8

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example Suppose we have Then, the characteristic equation of this relation is Here we have two possible sequences: Possible explicit formulas are 9 Which one is correct? => Depend on the initial cond.

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Lemma If and are sequences that satisfy the same second-order linear homogeneous recurrence relation with constant coefficients, and if C and D are any numbers, then the sequence defined by the formula also satisfies the same recurrence relation. 10

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example Suppose we have Then, the characteristic equation of this relation is None of are right. Set We have 11

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Theorem Distinct-Roots Theorem Suppose a sequence satisfies a recurrence relation for some real numbers A and B with and all integers. If the characteristic equation has two distance roots r and s, then is given by the explicit formula Where C and D are the numbers whose value are determined by the values and. 12

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Distinct-Roots Theorem Example The Fibonacci sequence Characteristic equation: Note that Set 13

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Lemma The Single-Root Case Let A and B be real numbers and suppose the characteristic equation has a single root r. Then the sequences and both satisfy the recurrence relation for all integer since and if we assume 14

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Theorem Single-Roots Theorem Suppose a sequence satisfies a recurrence relation for some real numbers A and B with and all integers. If the characteristic equation has a single (real) root r, then is given by the explicit formula Where C and D are the real numbers whose values are determined by the values of and any other known value of the sequence. 15

Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University Example Suppose a sequence satisfies a recurrence relation with initial conditions. Find an explicit formula for. 16