Recurrence Relations. fib(0) = 1 fib(1) = 1 q(0) = 1
|
|
- Robyn May
- 5 years ago
- Views:
Transcription
1 Recurrence Relations Reading: Gossett Sections 7.1 and 7.. Definition: Aone-wayinfinite sequence is a function from the natural numbers to some other set. E.g. fib(0) = 1, fib(1) = 1, fib() =,fib(3) = 3, fib(4) =, fib() = 8,. q(0) = 1,q(1) =,q() = 4,q(3) = 8,... pr(0) =,pr(1) = 3,pr() =,pr(3) = 7,... Definition: A recurrence relation is an equation that defines all members of a sequence past a certain point in terms of earlier members. That is an equation a(n) =F, for all n {n 1,n 1 +1, } where F is an expression combining only a(n 1), a(n ),..., a(0). Examples fib(n) =fib(n 1) + fib(n ), foralln q(n) = q(n 1), foralln 1 Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations If we conjoin enough (n 1 ) base cases with the recurrence relation, then together they define a sequence. Examples: fib(0) = 1 fib(1) = 1 q(0) = 1 Typeset November 3, 00 1 Typeset November 3, 00
2 Substitute and simplify method Consider the sequence defined by a(0) = a(n) =a(n 1) 3, forn 1 We can reason (rather informally) that. a(n) =a(n 1) 3 =(a(n ) 3) 3 substitution =4a(n ) 3 3 simplify =4(a(n 3) 3) 3 3 substitution =8a(n 3) simplify. = k a(n k) 3( k 1 + k + +1). = n a(0) 3 n 1 + n + +1 = n 3 ( n 1) since = n +3 = n+1 +3 Xn 1 i = n 1 Typeset November 3, 00 3 i=0 Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations If there is any doubt, we can prove the result by induction. Unfortunately the substitute and simplify method does not always give an easy to simplify result. Typeset November 3, 00 4
3 Linear Homogeneous Recurrence Relations with Constant Coefficients of Degree k Definition: Alinear homogeneous recurrence relation with constant coefficients (LHRRCC) is a recurrence relation whose RHS is a sum of terms each of the form c b a(n j) where c C and j N are constants. Definition: The degree of a LHRRCC is the maximum b value for which the c valueisnot0.i.e.ifwehave a(n) =c 1 a(n 1) + c a(n ) + + c k a(n k) with c k 6=0, then the degree is k. Whenthedegreeis Considerthedegreecase.TheRRis a(n) =c 1 a(n 1) + c a(n ) (*) Typeset November 3, 00 Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations Suppose there is a solution for the recurrence relation of the form a(n) =θr n,foralln N for some θ 6= 0and some r 6= 0. Then substituting into (*) we get (for any n N) θr n = c 1 θr n 1 + c θr n Thus r n c 1 r n 1 c r n =0 Thus r n (r c 1 r c )=0 So r is a root of the polynomial x c 1 x c (**) Conversely, if r is root of the polynomial x c 1 x c (**) then for any θ and any n N θr n = c 1 θr n 1 + c θr n so a(n) =θr n isasolutionto(*). The characteristic polynomial of (*) is (**). Typeset November 3, 00 6
4 We have proved the following theorem: Theorem: If r is a root of the characteristic polynomial x c 1 x c then, for any θ C, the sequence a(n), θr n, for all n N. is a solution to the equation a(n) =c 1 a(n 1) + c a(n ), for all n. Example. a(n) =a(n 1) + 6a(n ) The characteristic polynomial is x x 6 With roots 3 and. One root is r =3;pickingθ =1, we get a sequence 3 0, 3 1, 3, 3 4,... = h1, 3, 9, 7,...i So if the base cases are a(0) = 1 and a(1) = 3, we should pick r =3and θ =1. Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations Trying the other root r = and picking θ =3we get 3 ( ) 0, 3 ( ) 1, 3 ( ), 3 ( ) 3,... h3, 6, 1, 4,...i So if the base cases are a(0) = 3 and a(1) = 6, we should pick r = and θ =3. Unfortunately the base cases may not allow such a simple solution. Consider a(0) = a(1) = 3 a(n) =a(n 1) + 6a(n ) The roots are r 1 =3and r =. Tryingr 1 we must find θ such that θ3 0 = and θ3 1 =3 Trying r we must find a θ such that θ ( ) 0 = and θ ( ) 1 =3 Neither root gives a solution that agrees with both base cases. Typeset November 3, 00 7 Typeset November 3, 00 8
5 Linear combinations of solutions Suppose that we have a recurrence relation: a(n) =c 1 a(n 1) + c a(n ), for all n Now suppose we know a particular sequence w solves the recurrence. I.e. w(n) =c 1 w(n 1) + c w(n ), for all n Then, for any constant θ, wecandefine a new sequence y defined by y(n), θ w(n), foralln N Thistoowillbeasolutionas,foralln y(n) =θ w(n) = θ(c 1 w(n 1) + c w(n )) = c 1 θw(n 1) + c θw(n ) = c 1 y(n 1) + c y(n ) So multiplying a solution by any constant gives a solution. Suppose that w and x are two solutions. I.e. w(n) =c 1 w(n 1) + c w(n ), for all n Typeset November 3, 00 9 Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations and x(n) =c 1 x(n 1) + c x(n ), for all n Then we can build a sequence z defined by z(n), w(n)+x(n), for all n N Now z toowillbeasolutionas,foralln z(n) =w(n)+x(n) = c 1 w(n 1) + c w(n ) + c 1 x(n 1) + c x(n ) = c 1 (w(n 1) + x(n 1)) + c (w(n ) + x(n )) = c 1 z(n 1) + c (z(n ) So given any two solutions, x and w, any linear combination of them z(n), θ 1 w(n)+θ x(n), foralln N will also be a solution. A set that is closed under linear combinations is called a vector space. If the degree is, all solutions can be formed as linear combination of just (appropriately chosen) solutions. If there are two different roots, we have two solutions r1 n and r n, which will suffice. Typeset November 3, 00 10
6 Using both roots at once Consider, again, the LHRRCC of degree. a(n) =c 1 a(n 1) + c a(n ), foralln (*) with characteristic polynomial x c 1 x c =0 Let r 1 and r be the roots of this polynomial. Consider any two constants θ 1 and θ. θ 1 r1 n + θ r n isasolutionto(*) since it is a linear combination of the solutions r1 n and rn. Here is a direct proof: θ 1 r1 n + θ r n isasolutionto(*) iff θ 1 r1 n + θ r n = c 1 θ1 r1 n 1 + θ r n 1 + c1 θ1 r1 n + θ r n iff θ 1 r n 1 c 1 r1 n 1 c r1 n + θ r n c 1 r n 1 c r n =0 iff iff θ 1 r n 1 1 r 1 c 1 r 1 c + θ r n 1 r c 1 r c =0 T Typeset November 3, Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations This proves the following theorem Theorem: Given the LHRRCC of degree a(n) =c 1 a(n 1) + c a(n )., for all n> (*) If r 1 and r are the two roots of the characteristic polynomial x c 1 x c then for any θ 1 and θ isasolutionto(*). θ 1 r n 1 + θ r n Furthermore, if we know a(0) and a(1).then θ 1 + θ = a(0) θ 1 r 1 + θ r = a(1) With linear equations in unknowns we can solve for θ 1 and θ. This will succeed provided r 1 6= r. So, when the roots are distinct, we can find the unique values for θ 1 and θ that satisfy the two base cases. Typeset November 3, 00 1
7 Example: a(0) = a(1) = 3 a(n) =a(n 1) + 6a(n ) The characteristic polynomial x x 6=0 has roots r 1 =3and r =. Sowearelookingfora solution of the form θ 1 3 n + θ ( ) n We have θ 1 + θ = a(0) = 3θ 1 θ = a(1) = 3 So 3θ 1 ( θ 1 )=3 θ 1 +4 = 3 θ 1 = 1 Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations and θ = θ 1 θ = 9 Procedure From the RR derive the characteristic polynomial Find roots r 1 and r of the characteristic polynomial. If r 1 6= r then look for a solution of the solution of the form θ 1 r n 1 + θ r n use the base cases to solve for θ 1 and θ Example: fib(0) = 1 fib(1) = 1 fib(n) =fib(n 1) + fib(n ) Form the characteristic polynomial x x 1=0 Typeset November 3, Typeset November 3, 00 14
8 Find roots using the quadratic equation. The roots are 1+ = = φ and 1 = =1 φ = 1 φ We are looking for a solution of the form θ 1 φ n + θ (1 φ) n Using fib(0) = fib(1) = 1 we get θ 1 + θ =1 θ 1 φ + θ (1 φ) =1 Substitute θ =1 θ 1 into θ 1 φ + θ (1 φ) =1to get θ 1 φ +(1 θ 1 )(1 φ) =1 Now solve for θ 1. θ 1 φ +(1 θ 1 )(1 φ) =1 θ 1 φ +(1 φ) θ 1 (1 φ) =1 θ 1 (φ (1 φ)) = φ θ 1 (φ 1) = φ θ 1 =φ θ 1 = φ = 1+ = + 10 Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations And then solve for θ θ =1 θ 1 = φ φ = = 1+ 1 = = 1 φ Sothesolutionis fib(n) = φ φ n (1 φ) (1 φ) n = 1 φ n+1 1 (1 φ) n+1 These ideas generalize to degrees larger than. Typeset November 3, 00 1 Typeset November 3, 00 16
9 Repeated roots for LHRRCCs with degree When r 1 = r then θ 1 r1 n + θ r n canbewrittenasθrn where θ = θ 1 + θ and r = r 1 = r. So the base cases may form an overdetermined system: equations and one unknown. Example a(0) = 1 a(1) = a(n) =6a(n 1) 9a(n ), forn The characteristic polynomial is x 6x +9 with root r =3. We look for a solution of the form θr n But θ =1 θr = is not solvable! Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations Consider a quadratic with a repeated root x 4x +4 so r =.ThisischaracteristicoftheLHRRCC a(n) =4a(n 1) 4a(n ) adding a couple of base cases a(0) = 0 and a(1) = we get n a(n) = = = = 160 The solution is apparently n n. This suggests nr n is a potential solution in general. Note that nr n is r nr n 1 and that nr n 1 is the derivative of our basic solution r n. So we might do well to look at derivatives. Typeset November 3, Typeset November 3, 00 18
10 Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations When a polynomial has a repeated root, that root will also be a root of its derivative: x Consider x 6x +9 = (x 3) and its derivative (x 3), 3 is a root of both. In general (for all r R) if p(x) =x c 1 x c =(x r) then r willalsobearootofp 0 (x) =x c 1 =(x r). Define p 0 (x), x n p(x) r will also be a root of p 0 since p 0 (r) =r n p(r) =0. r will be a root of p 0 0 since p 0 0(r) =r n p 0 (r)+(n )r n 3 p(r) =0. Theorem: If a LHRRCC of the form a(n) =c 1 a(n 1) + c a(n 1), foralln (*) has a characteristic polynomial with one root r then, nr n is a solution: Proof: Let p and p 0 be polynomials defined by p(x), x c 1 x c p 0 (x), x n p(x) As we just saw, since r isthesolerootofp, itisalsoa root of p 0 0. Typeset November 3, Typeset November 3, 00 0
11 What is p 0 0? p 0 (x) =x n p(x) =x n c 1 x n 1 c x n p 0 0(x) =nx n 1 c 1 (n 1)x n c (n )x n 3 Now (for all n ) nr n is a solution of the RR (*) nr n = c 1 (n 1)r n 1 + c (n )r n nr n c 1 (n 1)r n 1 c (n )r n =0 r (nr n 1 c 1 (n 1)r n c (n )r n 3 )=0 r p 0 0(r) =0 T Since r is a root of p 0 0 Theorem: If a LHRRCC of the form a(n) =c 1 a(n 1) + c a(n 1), foralln (*) has a characteristic polynomial with one root r then, for any α 0,α 1 R, (α 0 + α 1 n)r n is a solution. Proof: (α 0 + α 1 n)r n is just a linear combination of the solutions r n and nr n. Wecanusethebasecasestocomputetheα 0 and α 1. Typeset November 3, 00 1 Discrete Math. for Engineering, 00. Notes 7. Recurrence Relations Back to the earlier example a(0) = 1 a(1) = a(n) =6a(n 1) 9a(n ), forn The root of the characteristic polynomial x 6x +9is 3. From the theorem, the solution is of the form (α 0 +α 1 n) 3 n Now solve α 0 =1 (α 0 + α 1 ) 3= so α 1 = 3 1= 1 3 Check: n a(n) (1 1 3n) 3n 0 1 ( ) 30 =1.0 1 ( ) 31 = =3 (1 1 3 ) 3 = =0 ( ) 33 = = 7 ( ) 34 = = 16 (1 1 3 ) 3 = 16.0 Procedure for LHRRCC of degree From the RR derive the characteristic polynomial Typeset November 3, 00
12 Find roots r 1 and r of the characteristic polynomial. If r 1 6= r then look for a solution of the solution of the form θ 1 r n 1 + θ r n Use the base cases to solve for θ 1 and θ. If the sole root is r then look for a solution of the form (α 0 + α 1 n)r n Use the base cases to solve for α 0 and α 1. One can generalize these theorems and the resulting procedure to LHRRCCs with any degree and any number of repeated roots. See Gossett s book. Typeset November 3, 00 3
CSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
Definition (Linear homogeneous recurrence) A linear homogeneous recurrence relation of degree k with constant coefficients is a recurrence relation of the form a n = c 1 a n 1 + c 2 a n 2 +... + c k a
More informationSeries Solutions Near a Regular Singular Point
Series Solutions Near a Regular Singular Point MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Background We will find a power series solution to the equation:
More informationExam 2 Solutions. x 1 x. x 4 The generating function for the problem is the fourth power of this, (1 x). 4
Math 5366 Fall 015 Exam Solutions 1. (0 points) Find the appropriate generating function (in closed form) for each of the following problems. Do not find the coefficient of x n. (a) In how many ways can
More informationReview for Exam 2. Review for Exam 2.
Review for Exam 2. 5 or 6 problems. No multiple choice questions. No notes, no books, no calculators. Problems similar to homeworks. Exam covers: Regular-singular points (5.5). Euler differential equation
More informationEquations with regular-singular points (Sect. 5.5).
Equations with regular-singular points (Sect. 5.5). Equations with regular-singular points. s: Equations with regular-singular points. Method to find solutions. : Method to find solutions. Recall: The
More informationAnalysis I (Math 121) First Midterm Correction
Analysis I (Math 11) First Midterm Correction Fall 00 Ali Nesin November 9, 00 1. Which of the following are not vector spaces over R (with the componentwise addition and scalar multiplication) and why?
More informationMath 2602 Finite and Linear Math Fall 14. Homework 8: Core solutions
Math 2602 Finite and Linear Math Fall 14 Homework 8: Core solutions Review exercises for Chapter 5 page 183 problems 25, 26a-26b, 29. Section 8.1 on page 252 problems 8, 9, 10, 13. Section 8.2 on page
More informationMATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #12
MATH0 Introduction to Analysis (007 Fall and 008 Spring) Tutorial Note #1 Limit (Part ) Recurrence Relation: Type 1: Monotone Sequence (Increasing/ Decreasing sequence) Theorem 1: Monotone Sequence Theorem
More informationMath Assignment 11
Math 2280 - Assignment 11 Dylan Zwick Fall 2013 Section 8.1-2, 8, 13, 21, 25 Section 8.2-1, 7, 14, 17, 32 Section 8.3-1, 8, 15, 18, 24 1 Section 8.1 - Introduction and Review of Power Series 8.1.2 - Find
More informationSection 5.2 Solving Recurrence Relations
Section 5.2 Solving Recurrence Relations If a g(n) = f (a g(0),a g(1),..., a g(n 1) ) find a closed form or an expression for a g(n). Recall: nth degree polynomials have n roots: a n x n + a n 1 x n 1
More informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
More informationSection 7.2 Solving Linear Recurrence Relations
Section 7.2 Solving Linear Recurrence Relations If a g(n) = f (a g(0),a g(1),..., a g(n 1) ) find a closed form or an expression for a g(n). Recall: nth degree polynomials have n roots: a n x n + a n 1
More informationSolutions for Homework Assignment 2
Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove
More informationMath 192r, Problem Set #3: Solutions
Math 192r Problem Set #3: Solutions 1. Let F n be the nth Fibonacci number as Wilf indexes them (with F 0 F 1 1 F 2 2 etc.). Give a simple homogeneous linear recurrence relation satisfied by the sequence
More informationPart 3.3 Differentiation Taylor Polynomials
Part 3.3 Differentiation 3..3.1 Taylor Polynomials Definition 3.3.1 Taylor 1715 and Maclaurin 1742) If a is a fixed number, and f is a function whose first n derivatives exist at a then the Taylor polynomial
More informationMath 475, Problem Set #8: Answers
Math 475, Problem Set #8: Answers A. Brualdi, problem, parts (a), (b), and (d). (a): As n goes from to 6, the sum (call it h n ) takes on the values,, 8, 2, 55, and 44; we recognize these as Fibonacci
More information1 Series Solutions Near Regular Singular Points
1 Series Solutions Near Regular Singular Points All of the work here will be directed toward finding series solutions of a second order linear homogeneous ordinary differential equation: P xy + Qxy + Rxy
More informationThe well-known Fibonacci sequence is defined by a recurrence. Specifically,letF i denote the ith number. Then, we have:
Week 4 Recurrences (I) 4.1 The Fibonacci Sequence The well-known Fibonacci sequence is defined by a recurrence. Specifically,letF i denote the ith number. Then, we have: F 0 =0 (4.1) F 1 =1 (4.2) F n =
More informationSolution/Correction standard, second Test Mathematics A + B1; November 7, 2014.
Solution/Correction standard, second Test Mathematics A + B1; November 7, 014. Kenmerk : Leibniz/toetsen/Re-Exam-Math-A-B1-141-Solutions Course : Mathematics A + B1 (Leibniz) Vakcode : 1911010 Date : November
More information2 Series Solutions near a Regular Singular Point
McGill University Math 325A: Differential Equations LECTURE 17: SERIES SOLUTION OF LINEAR DIFFERENTIAL EQUATIONS II 1 Introduction Text: Chap. 8 In this lecture we investigate series solutions for the
More informationDiscrete Math. Instructor: Mike Picollelli. Day 10
Day 10 Fibonacci Redux. Last time, we saw that F n = 1 5 (( 1 + ) n ( 5 2 1 ) n ) 5. 2 What Makes The Fibonacci Numbers So Special? The Fibonacci numbers are a particular type of recurrence relation, a
More informationNotes on generating functions in automata theory
Notes on generating functions in automata theory Benjamin Steinberg December 5, 2009 Contents Introduction: Calculus can count 2 Formal power series 5 3 Rational power series 9 3. Rational power series
More informationMATH 312 Section 6.2: Series Solutions about Singular Points
MATH 312 Section 6.2: Series Solutions about Singular Points Prof. Jonathan Duncan Walla Walla University Spring Quarter, 2008 Outline 1 Classifying Singular Points 2 The Method of Frobenius 3 Conclusions
More informationMath Numerical Analysis
Math 541 - Numerical Analysis Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center San Diego State University
More informationRoots and Coefficients Polynomials Preliminary Maths Extension 1
Preliminary Maths Extension Question If, and are the roots of x 5x x 0, find the following. (d) (e) Question If p, q and r are the roots of x x x 4 0, evaluate the following. pq r pq qr rp p q q r r p
More informationMath 2142 Homework 5 Part 1 Solutions
Math 2142 Homework 5 Part 1 Solutions Problem 1. For the following homogeneous second order differential equations, give the general solution and the particular solution satisfying the given initial conditions.
More informationPropositional Logic. What is discrete math? Tautology, equivalence, and inference. Applications
What is discrete math? Propositional Logic The real numbers are continuous in the senses that: between any two real numbers there is a real number The integers do not share this property. In this sense
More informationThe Method of Frobenius
The Method of Frobenius R. C. Trinity University Partial Differential Equations April 7, 2015 Motivating example Failure of the power series method Consider the ODE 2xy +y +y = 0. In standard form this
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More information1) Synthetic Division: The Process. (Ruffini's rule) 2) Remainder Theorem 3) Factor Theorem
J.F. Antona 1 Maths Dep. I.E.S. Jovellanos 1) Synthetic Division: The Process (Ruffini's rule) 2) Remainder Theorem 3) Factor Theorem 1) Synthetic division. Ruffini s rule Synthetic division (Ruffini s
More informationElementary Differential Equations, Section 2 Prof. Loftin: Practice Test Problems for Test Find the radius of convergence of the power series
Elementary Differential Equations, Section 2 Prof. Loftin: Practice Test Problems for Test 2 SOLUTIONS 1. Find the radius of convergence of the power series Show your work. x + x2 2 + x3 3 + x4 4 + + xn
More informationWarm-up Simple methods Linear recurrences. Solving recurrences. Misha Lavrov. ARML Practice 2/2/2014
Solving recurrences Misha Lavrov ARML Practice 2/2/2014 Warm-up / Review 1 Compute 100 k=2 ( 1 1 ) ( = 1 1 ) ( 1 1 ) ( 1 1 ). k 2 3 100 2 Compute 100 k=2 ( 1 1 ) k 2. Homework: find and solve problem Algebra
More informationRecurrence Relations
Recurrence Relations Recurrence Relations Reading (Epp s textbook) 5.6 5.8 1 Recurrence Relations A recurrence relation for a sequence aa 0, aa 1, aa 2, ({a n }) is a formula that relates each term a k
More informationPower Series Solutions We use power series to solve second order differential equations
Objectives Power Series Solutions We use power series to solve second order differential equations We use power series expansions to find solutions to second order, linear, variable coefficient equations
More informationLinear Algebra Practice Problems
Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a
More informationNewton-Raphson Type Methods
Int. J. Open Problems Compt. Math., Vol. 5, No. 2, June 2012 ISSN 1998-6262; Copyright c ICSRS Publication, 2012 www.i-csrs.org Newton-Raphson Type Methods Mircea I. Cîrnu Department of Mathematics, Faculty
More informationODE Homework Series Solutions Near an Ordinary Point, Part I 1. Seek power series solution of the equation. n(n 1)a n x n 2 = n=0
ODE Homework 6 5.2. Series Solutions Near an Ordinary Point, Part I 1. Seek power series solution of the equation y + k 2 x 2 y = 0, k a constant about the the point x 0 = 0. Find the recurrence relation;
More informationWriting proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction
More informationMULTIPLYING TRINOMIALS
Name: Date: 1 Math 2 Variable Manipulation Part 4 Polynomials B MULTIPLYING TRINOMIALS Multiplying trinomials is the same process as multiplying binomials except for there are more terms to multiply than
More informationSolving Recurrence Relations 1. Guess and Math Induction Example: Find the solution for a n = 2a n 1 + 1, a 0 = 0 We can try finding each a n : a 0 =
Solving Recurrence Relations 1. Guess and Math Induction Example: Find the solution for a n = 2a n 1 + 1, a 0 = 0 We can try finding each a n : a 0 = 0 a 1 = 2 0 + 1 = 1 a 2 = 2 1 + 1 = 3 a 3 = 2 3 + 1
More information1 Recurrence relations, continued continued
1 Recurrence relations, continued continued Linear homogeneous recurrences are only one of several possible ways to describe a sequence as a recurrence. Here are several other situations which may arise.
More information17 Advancement Operator Equations
November 14, 2017 17 Advancement Operator Equations William T. Trotter trotter@math.gatech.edu Review of Recurrence Equations (1) Problem Let r(n) denote the number of regions determined by n lines that
More informationHandout 7: Recurrences (Cont d)
ENGG 2440B: Discrete Mathematics for Engineers Handout 7: Recurrences (Cont d) 2018 19 First Term Instructor: Anthony Man Cho So October 8, 2018 In the last handout, we studied techniques for solving linear
More informationData Structure Lecture#4: Mathematical Preliminaries U Kang Seoul National University
Data Structure Lecture#4: Mathematical Preliminaries U Kang Seoul National University U Kang 1 In This Lecture Set concepts and notation Logarithms Summations Recurrence Relations Recursion Induction Proofs
More informationCh. 7.6 Squares, Squaring & Parabolas
Ch. 7.6 Squares, Squaring & Parabolas Learning Intentions: Learn about the squaring & square root function. Graph parabolas. Compare the squaring function with other functions. Relate the squaring function
More informationInterpolating Accuracy without underlying f (x)
Example: Tabulated Data The following table x 1.0 1.3 1.6 1.9 2.2 f (x) 0.7651977 0.6200860 0.4554022 0.2818186 0.1103623 lists values of a function f at various points. The approximations to f (1.5) obtained
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationFall Math 3410 Name (Print): Solution KEY Practice Exam 2 - November 4 Time Limit: 50 Minutes
Fall 206 - Math 340 Name (Print): Solution KEY Practice Exam 2 - November 4 Time Limit: 50 Minutes This exam contains pages (including this cover page) and 5 problems. Check to see if any pages are missing.
More informationb n x n + b n 1 x n b 1 x + b 0
Math Partial Fractions Stewart 7.4 Integrating basic rational functions. For a function f(x), we have examined several algebraic methods for finding its indefinite integral (antiderivative) F (x) = f(x)
More informationChapter 7: The z-transform
Chapter 7: The -Transform ECE352 1 The -Transform - definition Continuous-time systems: e st H(s) y(t) = e st H(s) e st is an eigenfunction of the LTI system h(t), and H(s) is the corresponding eigenvalue.
More informationNumerical Methods. Lecture Notes #08 Discrete Least Square Approximation
Numerical Methods Discrete Least Square Approximation Pavel Ludvík, March 30, 2016 Department of Mathematics and Descriptive Geometry VŠB-TUO http://homen.vsb.cz/ lud0016/ 1 / 23
More informationBessel s Equation. MATH 365 Ordinary Differential Equations. J. Robert Buchanan. Fall Department of Mathematics
Bessel s Equation MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Background Bessel s equation of order ν has the form where ν is a constant. x 2 y + xy
More informationMath 113 Homework 5. Bowei Liu, Chao Li. Fall 2013
Math 113 Homework 5 Bowei Liu, Chao Li Fall 2013 This homework is due Thursday November 7th at the start of class. Remember to write clearly, and justify your solutions. Please make sure to put your name
More informationLecture 18: Section 4.3
Lecture 18: Section 4.3 Shuanglin Shao November 6, 2013 Linear Independence and Linear Dependence. We will discuss linear independence of vectors in a vector space. Definition. If S = {v 1, v 2,, v r }
More informationMath 283 Spring 2013 Presentation Problems 4 Solutions
Math 83 Spring 013 Presentation Problems 4 Solutions 1. Prove that for all n, n (1 1k ) k n + 1 n. Note that n means (1 1 ) 3 4 + 1 (). n 1 Now, assume that (1 1k ) n n. Consider k n (1 1k ) (1 1n ) n
More informationLINEAR RECURSIVE SEQUENCES. The numbers in the sequence are called its terms. The general form of a sequence is
LINEAR RECURSIVE SEQUENCES BJORN POONEN 1. Sequences A sequence is an infinite list of numbers, like 1) 1, 2, 4, 8, 16, 32,.... The numbers in the sequence are called its terms. The general form of a sequence
More informationMath (P)refresher Lecture 8: Unconstrained Optimization
Math (P)refresher Lecture 8: Unconstrained Optimization September 2006 Today s Topics : Quadratic Forms Definiteness of Quadratic Forms Maxima and Minima in R n First Order Conditions Second Order Conditions
More informationLinear Independence. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Linear Independence MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Given a set of vectors {v 1, v 2,..., v r } and another vector v span{v 1, v 2,...,
More informationMath 651 Introduction to Numerical Analysis I Fall SOLUTIONS: Homework Set 1
ath 651 Introduction to Numerical Analysis I Fall 2010 SOLUTIONS: Homework Set 1 1. Consider the polynomial f(x) = x 2 x 2. (a) Find P 1 (x), P 2 (x) and P 3 (x) for f(x) about x 0 = 0. What is the relation
More informationDefinition: A sequence is a function from a subset of the integers (usually either the set
Math 3336 Section 2.4 Sequences and Summations Sequences Geometric Progression Arithmetic Progression Recurrence Relation Fibonacci Sequence Summations Definition: A sequence is a function from a subset
More informationSPECIAL POINTS AND LINES OF ALGEBRAIC SURFACES
SPECIAL POINTS AND LINES OF ALGEBRAIC SURFACES 1. Introduction As we have seen many times in this class we can encode combinatorial information about points and lines in terms of algebraic surfaces. Looking
More informationConsider an infinite row of dominoes, labeled by 1, 2, 3,, where each domino is standing up. What should one do to knock over all dominoes?
1 Section 4.1 Mathematical Induction Consider an infinite row of dominoes, labeled by 1,, 3,, where each domino is standing up. What should one do to knock over all dominoes? Principle of Mathematical
More informationFall Lecture 5
15-150 Fall 2018 Lecture 5 Today Work sequential runtime Recurrences exact and approximate solutions Improving efficiency program recurrence work asymptotic Want the runtime of evaluating f(n), for large
More information1 Lecture 6-7, Scribe: Willy Quach
Special Topics in Complexity Theory, Fall 2017. Instructor: Emanuele Viola 1 Lecture 6-7, Scribe: Willy Quach In these lectures, we introduce k-wise indistinguishability and link this notion to the approximate
More informationEquations in Quadratic Form
Equations in Quadratic Form MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this lesson we will learn to: make substitutions that allow equations to be written
More informationInteractive protocols & zero-knowledge
Interactive protocols & zero-knowledge - interactive protocols formalize what can be recognized by polynomial time restricted verifiers in arbitrary protocols - generalizes NP - zero-knowledge formalizes
More informationMath 3 Variable Manipulation Part 3 Polynomials A
Math 3 Variable Manipulation Part 3 Polynomials A 1 MATH 1 & 2 REVIEW: VOCABULARY Constant: A term that does not have a variable is called a constant. Example: the number 5 is a constant because it does
More informationGreat Theoretical Ideas in Computer Science
15-251 Great Theoretical Ideas in Computer Science Recurrences, Fibonacci Numbers and Continued Fractions Lecture 9, September 24, 2009 Leonardo Fibonacci In 1202, Fibonacci proposed a problem about the
More informationMath 141: Lecture 19
Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,
More information12d. Regular Singular Points
October 22, 2012 12d-1 12d. Regular Singular Points We have studied solutions to the linear second order differential equations of the form P (x)y + Q(x)y + R(x)y = 0 (1) in the cases with P, Q, R real
More informationPartial Fractions. Combining fractions over a common denominator is a familiar operation from algebra: 2 x 3 + 3
Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: x 3 + 3 x + x + 3x 7 () x 3 3x + x 3 From the standpoint of integration, the left side of Equation
More informationProblem Set 1 Solutions
Introduction to Algorithms September 24, 2004 Massachusetts Institute of Technology 6.046J/18.410J Professors Piotr Indyk and Charles E. Leiserson Handout 7 Problem Set 1 Solutions Exercise 1-1. Do Exercise
More informationSOL Warm-Up Graphing Calculator Active
A.2c (a) Factoring polynomials SOL Warm-Up 1. Which of the following represents 12x 2 + 6x + 3 in simplified form after factoring out the greatest common factor? A 12(x 2 + 2x + 4) B x(12x 2 + 6x + 3)
More informationEE Homework 5 - Solutions
EE054 - Homework 5 - Solutions 1. We know the general result that the -transform of α n 1 u[n] is with 1 α 1 ROC α < < and the -transform of α n 1 u[ n 1] is 1 α 1 with ROC 0 < α. Using this result, the
More informationThe Method of Frobenius
The Method of Frobenius Department of Mathematics IIT Guwahati If either p(x) or q(x) in y + p(x)y + q(x)y = 0 is not analytic near x 0, power series solutions valid near x 0 may or may not exist. If either
More informationPolynomial Solutions of Nth Order Nonhomogeneous Differential Equations
Polynomial Solutions of th Order onhomogeneous Differential Equations Lawrence E. Levine Ray Maleh Department of Mathematical Sciences Stevens Institute of Technology Hoboken,J 07030 llevine@stevens-tech.edu
More informationJong C. Park Computer Science Division, KAIST
Jong C. Park Computer Science Division, KAIST Today s Topics Introduction Solving Recurrence Relations Discrete Mathematics, 2008 2 Computer Science Division, KAIST Definition A recurrence relation for
More informationInteractive protocols & zero-knowledge
Interactive protocols & zero-knowledge - interactive protocols formalize what can be recognized by polynomial time restricted verifiers in arbitrary protocols - generalizes NP - zero-knowledge formalizes
More informationSome Review Problems for Exam 2: Solutions
Math 5366 Fall 017 Some Review Problems for Exam : Solutions 1 Find the coefficient of x 15 in each of the following: 1 (a) (1 x) 6 Solution: 1 (1 x) = ( ) k + 5 x k 6 k ( ) ( ) 0 0 so the coefficient
More informationEvery subset of {1, 2,...,n 1} can be extended to a subset of {1, 2, 3,...,n} by either adding or not adding the element n.
11 Recurrences A recurrence equation or recurrence counts things using recursion. 11.1 Recurrence Equations We start with an example. Example 11.1. Find a recurrence for S(n), the number of subsets of
More informationWhat if the characteristic equation has a double root?
MA 360 Lecture 17 - Summary of Recurrence Relations Friday, November 30, 018. Objectives: Prove basic facts about basic recurrence relations. Last time, we looked at the relational formula for a sequence
More informationUCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 14 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 14 Notes Goals for this week Big-O complexity
More informationSolving Quadratic and Other Polynomial Equations
Section 4.3 Solving Quadratic and Other Polynomial Equations TERMINOLOGY 4.3 Previously Used: This is a review of terms with which you should already be familiar. Formula New Terms to Learn: Discriminant
More informationApril 30, Name: Amy s Solutions. Discussion Section: N/A. Discussion TA: N/A
Math 1151, April 30, 010 Exam 3 (in-class) Name: Amy s Solutions Discussion Section: N/A Discussion TA: N/A This exam has 8 multiple-choice problems, each worth 5 points. When you have decided on a correct
More informationIntroduction Linear system Nonlinear equation Interpolation
Interpolation Interpolation is the process of estimating an intermediate value from a set of discrete or tabulated values. Suppose we have the following tabulated values: y y 0 y 1 y 2?? y 3 y 4 y 5 x
More informationMath 0312 EXAM 2 Review Questions
Name Decide whether the ordered pair is a solution of the given system. 1. 4x + y = 2 2x + 4y = -20 ; (2, -6) Solve the system by graphing. 2. x - y = 6 x + y = 16 Solve the system by substitution. If
More informationMATH39001 Generating functions. 1 Ordinary power series generating functions
MATH3900 Generating functions The reference for this part of the course is generatingfunctionology by Herbert Wilf. The 2nd edition is downloadable free from http://www.math.upenn. edu/~wilf/downldgf.html,
More informationb for the linear system x 1 + x 2 + a 2 x 3 = a x 1 + x 3 = 3 x 1 + x 2 + 9x 3 = 3 ] 1 1 a 2 a
Practice Exercises for Exam Exam will be on Monday, September 8, 7. The syllabus for Exam consists of Sections One.I, One.III, Two.I, and Two.II. You should know the main definitions, results and computational
More informationINDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Design and Analysis of Algorithms Department of Mathematics MA21007/Assignment-2/Due: 18 Aug.
INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Design and Analysis of Algorithms Department of Mathematics MA21007/Assignment-2/Due: 18 Aug. 2015 Problem 1. Computing Fibonacci Numbers The Fibonacci numbers
More informationTaylor Series. Math114. March 1, Department of Mathematics, University of Kentucky. Math114 Lecture 18 1/ 13
Taylor Series Math114 Department of Mathematics, University of Kentucky March 1, 2017 Math114 Lecture 18 1/ 13 Given a function, can we find a power series representation? Math114 Lecture 18 2/ 13 Given
More informationRepresentation of Functions as Power Series.
MATH 0 - A - Spring 009 Representation of Functions as Power Series. Our starting point in this section is the geometric series: x n = + x + x + x 3 + We know this series converges if and only if x
More informationExpectation maximization
Expectation maximization Subhransu Maji CMSCI 689: Machine Learning 14 April 2015 Motivation Suppose you are building a naive Bayes spam classifier. After your are done your boss tells you that there is
More informationConvergence of sequences and series
Convergence of sequences and series A sequence f is a map from N the positive integers to a set. We often write the map outputs as f n rather than f(n). Often we just list the outputs in order and leave
More informationThe method of Fröbenius
Note III.5 1 1 April 008 The method of Fröbenius For the general homogeneous ordinary differential equation y (x) + p(x)y (x) + q(x)y(x) = 0 (1) the series method works, as in the Hermite case, where both
More informationFactors of Polynomials Factoring For Experts
Factors of Polynomials SUGGESTED LEARNING STRATEGIES: Shared Reading, Activating Prior Knowledge, Discussion Group, Note-taking When you factor a polynomial, you rewrite the original polynomial as a product
More informationMath 112 Rahman. Week Taylor Series Suppose the function f has the following power series:
Math Rahman Week 0.8-0.0 Taylor Series Suppose the function f has the following power series: fx) c 0 + c x a) + c x a) + c 3 x a) 3 + c n x a) n. ) Can we figure out what the coefficients are? Yes, yes
More informationCHANGE OF BASIS FOR LINEAR SPACES
CHANGE OF ASIS FOR LINEAR SPACES. Motivating Example Consider P 2 the space of polynomials of degree at most 2. Let : P 2 P 2 be defined by (p)(x) = p (x) p(x). his is a linear transformation. We would
More informationLecture 7.5: Euclidean domains and algebraic integers
Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley
More informationGreat Theoretical Ideas in Computer Science
15-251 Great Theoretical Ideas in Computer Science Recurrences, Fibonacci Numbers and Continued Fractions Lecture 9, September 23, 2008 Happy Autumnal Equinox http://apod.nasa.gov/apod/ap080922.html Leonardo
More informationModule 5 : Linear and Quadratic Approximations, Error Estimates, Taylor's Theorem, Newton and Picard Methods
Module 5 : Linear and Quadratic Approximations, Error Estimates, Taylor's Theorem, Newton and Picard Methods Lecture 14 : Taylor's Theorem [Section 141] Objectives In this section you will learn the following
More information