MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 25, Friday, October 31.

Slides:



Advertisements
Similar presentations
Lecture 17 Generating Functions. Recap Generating functions are defined by a sequence as follows: Thus: For every sequence there a generating function.
Advertisements

Chapter 13 sec. 3.  Def.  Is an ordering of distinct objects in a straight line. If we select r different objects from a set of n objects and arrange.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 19, Friday, October 17.
Chapter 9 Generating functions Yen-Liang Chen Dept of Information Management National Central University.
Binomial Identities.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 26, Monday, November 3.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 22, Friday, October 24.
Chapter 6.1 Generating Functions
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 24, Wednesday, October 29.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 27, Wednesday, November 5.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 15, Friday, October 3.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 16, Monday, October 6.
4/5/05Tucker, Sec Applied Combinatorics, 4rth Ed. Alan Tucker Section 5.4 Distributions Prepared by Jo Ellis-Monaghan.
Arrangements & Selections with Repetition
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 39, Monday, December 8.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 34, Friday, November 21.
Exponential Generating Function
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 21, Wednesday, October 22.
Skip Counting Counting by 2, 5, and 10.
3/26/03 Tucker, Applied Combinatorics Section General Counting Methods for Arrangements and Selections Tucker, Applied Combinatorics, Sec. 5.1,
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 38, Friday, December 5.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 20, Monday, October 20.
Tucker, Section 5.41 Section 5.4 Distributions By Colleen Raimondi.
Main Menu Main Menu (Click on the topics below) Permutations with Some repetitions Example r-Combinations with Some repetitions Example Permutations and.
Interactive Math Note Book
More Counting Lecture 16: Nov 9 A B …… f. This Lecture We will study how to define mappings to count. There will be many examples shown. Bijection rule.
7.4 Generating Functions Definition 1: The generation function for the sequence a 0, a 1,...,a k,... of real numbers is the infinite series G(x) = a 0.
Advanced Math Topics 4.4 Permutations. You have six younger brothers, George 1, George 2, George 3, George 4, George 5, and George 6. They all want your.
Basic Counting. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations, combinations.
Algebra I Chapter 10 Review
Math 71B 11.1 – Sequences and Summation Notation 1.
1 Discrete and Combinatorial Mathematics R. P. Grimaldi, 5 th edition, 2004 Chapter 6 Generating Functions.
Proportions Round One 2) x + 3 = 15 Answers 2.) x + 3 = 15 X=12 21.
EXAMPLE 1 Multiply a monomial and a polynomial Find the product 2x 3 (x 3 + 3x 2 – 2x + 5). 2x 3 (x 3 + 3x 2 – 2x + 5) Write product. = 2x 3 (x 3 ) + 2x.
Chapter 7 Advance Counting Techniques. Content Recurrence relations Generating function The principle of inclusion-exclusion.
Solve x 2 +3x – 5 = 11 xx2x2 +3x-5X 2 +3x-5High/ Low L.
MATH 416 Equations & Inequalities II. Solving Systems of Equations Apart from the graphic method, there are three other methods we could use to solve.
Properties of Addition and Multiplication Why is it important to recognize these properties? It helps us with mental math. It helps us recognize patterns.
Daily Homework Quiz 1. Evaluate when () 8x8x – 2+x = x Evaluate the expression ()2)2 – 2. Evaluate when ) 6p6p–5p 25p 2 ( –4 – = p
Example 1 Identifying Parts of an Expression Identify the terms, coefficients, like terms, and constant terms of the expression. 2+5x5x3–7x7x– SOLUTION.
Properties of Addition and Multiplication. Commutative Property  Commute or move around  Changing the order of the numbers in the problem does not change.
Standard Accessed: Students will analyze sequences, find sums of series, and use recursive rules.
Lecture 16 Generating Functions. Basically, generating functions are a tool to solve a wide variety of counting problems and recurrence relations, find.
5.5 Generalized Permutations and Combinations
Distributive Property Review 2(x + 4) 2(x) + 2(4) 2x + 8.
The Distributive Property Section 1.4. Distributive Property.
Making a Line Plot Collect data and put in chronological order Determine a scale and intervals If you have a small range, you should probably use intervals.
UNIT 5 Fundamental principles of counting
Sequences • Digits Lesson 1 Saxon Math 6/5 Facts Practice A.
Properties of Addition and Multiplication
Equations with Variables on Both Sides
8.6 Multiplying a Polynomial by a Monomial
Skip Counting Counting by 2, 5, and 10.
Binomial Identities.
Arrangements & Selections with Repetition
Arrangements & Selections with Repetition
Skip Counting Counting by 2, 5, and 10.
Binomial Identities.
More Counting A B … f Lecture 16: Nov 9.
Linear Algebra Lecture 3.
Basic Counting Lecture 9: Nov 5, 6.
I Got the Power! Powers and Exponents SOL 6.5 By Kathy Woodard 2011
Combinations with repetitions allowed
Objective: Students will solve systems by graphing
Jeopardy.
Discrete Structures Meeting 15 October 19, 2017.
Ready?.
+/- Numbers Year 3-4 – Addition and subtraction of hundreds within
Presentation transcript:

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 25, Friday, October 31

6.1. Generating Function Models Algebra-Calculus approach. We are given a finite or infinite sequence of numbers a 0, a 1,..., a n,... Then the generating function g(x) for a n is given by: g(x) = a 0 + a 1 x a 2 x n +...

6.1. Generating Function Models Homework (MATH 310#8F): Read 6.2. Turn in 6.1: 6,8,10,22 Volunteers: ____________ Problem: 22.

Combinatorial Approach (a + x)(a + x)(a + x) = aaa + aax + axa + xaa + axx + xax + xxa + xxx. What is the coefficient at x 2 ? axx + xax + xxa  3x 2. [3 = C(3,2)] (1 + x)(1 + x)(1 + x) = x + 1x1 + x11 +1xx + x1x + xx1 + xxx = 1 + 3x + 3x 2 + x 3 In general, in (1 + x) n the coefficient at x r is C(n,r).

Question What is the meaning of the coefficient at x 5 in (1 + x + x 2 ) 4 ? xxxx 2 + xxx 2 x + xx 2 xx + x 2 xxx + 1xx 2 x 2 + 1x 2 xx 2 + 1x 2 x 2 x ( 16) Number of solutions to a + b + c + d = 5, 0 · a, b, c, d · 2. Number of selections of 5 objects from four types with at most 2 of each type- Number of distributions of 5 identical objects into four boxes with at most 2 objects in any box.

Example 1 Find the generating function for a r, the number of ways to select r balls from a pile of three green, three white, three blue and three gold balls. Answer: (1 + x + x 2 + x 3 ) 4

Example 2 Use a generating function model for the problem of counting all selections of six objects from three types of objects with repetition of up to four objects of each type. Also model the problem with unlimited repetition. Answer: (a) (1 + x + x 2 + x 3 + x 4 ) 3 (b) (1 + x + x 2 + x ) 3

Example 3 Find the generating function for a r, the number of ways to distribute r identical objects into five distinct boxes with an even number of objects not exceeding 10 in the first two boxes and between three and five in the other boxes. Answer: (1 + x 2 + x 4 + x 6 + x 8 + x 10 ) 2 (x 3 + x 4 + x 5 ) 3