MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 38, Friday, December 5.

Slides:



Advertisements
Similar presentations
SECOND-ORDER DIFFERENTIAL EQUATIONS
Advertisements

Chapter 6 Advanced Counting 6.1 Recurrence Relations.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 19, Friday, October 17.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 26, Monday, November 3.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 22, Friday, October 24.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 27, Wednesday, November 5.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 39, Monday, December 8.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 25, Friday, October 31.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 36, Monday, December 1.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 34, Friday, November 21.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 21, Wednesday, October 22.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 20, Monday, October 20.
Warm Up #3 Find the exact value. 2. –√ √49 ANSWER –12 7 ANSWER
Warm-Up: December 13, 2011  Solve for x:. Complex Numbers Section 2.1.
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
Solving Exponential and Logarithmic Equations Section 8.6.
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
CS 312: Algorithm Analysis Lecture #8: Non-Homogeneous Recurrence Relations This work is licensed under a Creative Commons Attribution-Share Alike 3.0.
Recurrence Relation. Outline  What is a recurrence relation ?  Solving linear recurrence relations  Divide-and-conquer algorithms and recurrence relations.
Module #17: Recurrence Relations Rosen 5 th ed., §
RECURRENCE Sequence Recursively defined sequence
1.10 and 1.11 Quiz : Friday Matrices Test: Oct. 20.
Solving Quadratic Equations
Using square roots to solve quadratic equations. 2x² = 8 22 x² = 4 The opposite of squaring a number is taking its square root √ 4= ± 2.
Mathe III Lecture 4 Mathe III Lecture 4 Mathe III Lecture 4 Mathe III Lecture 4.
Unit 7 Quadratics Radical Equations Goal: I can solve simple radical equations in one variable (A-REI.2)
Section 1.7 continued Solving Absolute Value Inequalities.
8-1 Completing the Square
CHAPTER TWO RECURRENCE RELATION
7.6 Rational Zero Theorem Depressed equation. All the possible rational Zeros To find all the possible rational zero, take all the factors of the last.
Recurrence Relations. Outline Recurrence relationsSolving recurrence relationsRecurrence and Divide-and-conquer algorithmsGenerating functions
Solving Algebra Equations Objective: To solve all kinds of algebra equations.
1.4 Identity and Equality Properties The sum of any number and 0 is equal to the number. So, 0 is called the additive identity. a + 0 = 0 + a = a
2.2 Solving Two- Step Equations. Solving Two Steps Equations 1. Use the Addition or Subtraction Property of Equality to get the term with a variable on.
: Solve using mental math. 1.3x = –18 ANSWER –6 ANSWER –10 2. b + 21 = Simplify the expression 3 ( x + 2 ) – 4x + 1. ANSWER –x + 7.
Lecture 5 Inhomogeneous ODEs Intro to Fourier Series You’ll solve an inhomogeneous ODE extra example We’ll look at using complex numbers to solve IODEs.
Chapter 2 Fundamentals of the Analysis of Algorithm Efficiency Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Solve Linear Systems By Multiplying First
Solving Algebra Equations
Solving Polynomial Equations
Using Number Sense to Solve One-Step Equations
Using Number Sense to Solve One-Step Equations
Introduction to Recurrence Relations
Theorem Let an = can/k + f(n) be recurrence relation with positive constant c and the positive function f(n). (a) If for large n, f(n) grows proportional.
UNIT-6 Recurrence Relations
6.5. A Summation Method Asume that:
Solving Equations: The Multiplication Principle
Non-Homogeneous Recurrence Relations
Module #17: Recurrence Relations
Chapter 6.4 Completing the Square Standard & Honors
Unit 4 Lesson 1: Completing the square
Linear Algebra Lecture 3.
Module #17: Recurrence Relations
Before: December 4, 2017 Solve each system by substitution. Steps:
CSE 2010: Algorithms and Data Structures
9.2 Solving Quadratic Equations using square roots
Solving Multiplication Equations
Warm Up #3 Find the exact value. 2. –√ √49 ANSWER –12 7 ANSWER
MATH 1310 Section 2.8.
Chapter 7 Advanced Counting Techniques
MATH 1310 Section 2.8.
MATH 1310 Section 2.8.
Solving Systems of Equations by Elimination Part 2
5.4 Complex Numbers.
Warm-Up Set 1: Factor. 1) x2 + 6x + 9 2) x2 - 10x + 25 Set 2: Factor.
Math-7 NOTES 1) 3x = 15 2) 4x = 16 Multiplication equations:
19. More Solving Equations
Review: 6.5d Mini-Quiz 1. Solve: 9x2 + 12x + 4 = 0.
Recurrence Relations Rosen 5th ed., §6.2 5/22/2019
MATH 1310 Section 2.8.
Presentation transcript:

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 38, Friday, December 5

Example 4: Complex and Multiple Roots a n = -2a n-2 – a n-4, a 0 = 0, a 1 = 1, a 2 = 2, a 3 = 3. Note that the solution from the book reduces to: a 4k = -4k a 4k+1 = 1 – 8k a 4k+2 = 4k+2 a 4k+3 = 8k + 3

7.4. Solution of Inhomogeneous Recurrence Relations Homework (MATH 310#11F): Read 7.5 Do 7.4: all odd numbered problems Turn in 7.4: 2,4,10,12,18

Example 1: Summation Recurrence (See Example 3, 7.1, p. 275) Dividing the plane: a n = a n-1 + n, a 0 = 1. a n = 1 + ( n) n = C(1,1) + C(2,1) C(n,1). By identity (8) from 5.5: C(r,r) + C(r+1,r) +...+C(n,r) = C(n+1,r+1) n = C(n+1,2) = (n+1)n/2 a n = 1 + n(n+1)/2. Another approach: Undermined coefficients: a n = An 2 + Bn + C. Select three values for n, say n= 0, n= 1 and n= 2 a 0 = C a 1 = A + B + C a 2 = 4A + 2B + C. Solve for A,B,C.

Particular Solutions f(n)p(n) dB dnB 1 n + B 0 dn 2 B 2 n 2 + B 1 n + B 0 ed n Bd n

Example 2: Solving Tower of Hanoi Puzzle (See Example 4 of 7.1) a n = 2a n-1 + 1, a 1 = 1. General solution to the homogeneous equation a n = 2a n-1. is a n = A 2 n. Particular solution to inhomogeneous relation a n * = B. Determine B. B = 2B + 1. Hence B =-1. General solution to inhomogeneous relation: a n = A 2 n –1. Determine A. a 1 = A 2 1 – 1 = 2 A – 1 = 1. Hence A = 1. Answer: a n = 2 n –1.

Example 3: Compound Inhomogeneous Term.