Generating Functions. 1 Operations on generating functions

Similar documents
CSE 21 Mathematics for

1 Generating functions for balls in boxes

Math 155 (Lecture 3)

Intermediate Math Circles November 4, 2009 Counting II

Chapter 6. Advanced Counting Techniques

CIS Spring 2018 (instructor Val Tannen)

Math 475, Problem Set #12: Answers

CALCULATION OF FIBONACCI VECTORS

( ) GENERATING FUNCTIONS

Section 5.1 The Basics of Counting

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

n m CHAPTER 3 RATIONAL EXPONENTS AND RADICAL FUNCTIONS 3-1 Evaluate n th Roots and Use Rational Exponents Real nth Roots of a n th Root of a

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.

Introduction To Discrete Mathematics

Properties and Tests of Zeros of Polynomial Functions

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

Infinite Series and Improper Integrals

2.4 - Sequences and Series

Generating Functions II

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Let us consider the following problem to warm up towards a more general statement.

Ma 530 Introduction to Power Series

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

Permutations, Combinations, and the Binomial Theorem

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Recurrence Relations

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Bertrand s Postulate

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

SNAP Centre Workshop. Basic Algebraic Manipulation

Complex Numbers Solutions

AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif.

Axioms of Measure Theory

The Binomial Theorem

Worksheet on Generating Functions

Review for Test 3 Math 1552, Integral Calculus Sections 8.8,

CHAPTER 10 INFINITE SEQUENCES AND SERIES

Lecture Notes for CS 313H, Fall 2011

Permutations & Combinations. Dr Patrick Chan. Multiplication / Addition Principle Inclusion-Exclusion Principle Permutation / Combination

( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =!

REVIEW FOR CHAPTER 1

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]

NUMERICAL METHODS FOR SOLVING EQUATIONS

MT5821 Advanced Combinatorics

MAT 271 Project: Partial Fractions for certain rational functions

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

P1 Chapter 8 :: Binomial Expansion

COMM 602: Digital Signal Processing

End-of-Year Contest. ERHS Math Club. May 5, 2009

Chapter 4. Fourier Series

Week 5-6: The Binomial Coefficients

Chapter 10: Power Series

4.1 Sigma Notation and Riemann Sums

ENGI Series Page 6-01

Course : Algebraic Combinatorics

Math 113 Exam 3 Practice

Injections, Surjections, and the Pigeonhole Principle

LESSON 2: SIMPLIFYING RADICALS

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:

RADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify

Application of Jordan Canonical Form

Enumerative & Asymptotic Combinatorics

3 Gauss map and continued fractions

+ au n+1 + bu n = 0.)

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y

MH1101 AY1617 Sem 2. Question 1. NOT TESTED THIS TIME

David Vella, Skidmore College.

Chapter 8: Estimating with Confidence

COS 341 Discrete Mathematics. Exponential Generating Functions and Recurrence Relations

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

Discrete Mathematics Recurrences

Addition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is

CALCULATING FIBONACCI VECTORS

4.1 SIGMA NOTATION AND RIEMANN SUMS

, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

Linear Programming and the Simplex Method

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 31B: MIDTERM 2 REVIEW

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics:

C. Complex Numbers. x 6x + 2 = 0. This equation was known to have three real roots, given by simple combinations of the expressions

6.003 Homework #3 Solutions

Chapter 7: Numerical Series

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

SEQUENCES AND SERIES

Carleton College, Winter 2017 Math 121, Practice Final Prof. Jones. Note: the exam will have a section of true-false questions, like the one below.

Chapter 1 : Combinatorial Analysis

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:

CS284A: Representations and Algorithms in Molecular Biology

1 Last time: similar and diagonalizable matrices

3.1 Counting Principles

Lesson 10: Limits and Continuity

Transcription:

Geeratig Fuctios The geeratig fuctio for a sequece a 0, a,..., a,... is defied to be the power series fx a x. 0 We say that a 0, a,... is the sequece geerated by fx ad a is the coefficiet of x. Example The geeratig fuctio for the sequece a 0, a,..., a +,... is fx +x+3x + ++x +. How do we determie what fx is as a fuctio of x? That is, as somethig other tha a power series? Operatios o geeratig fuctios Let F x a 0 +a x+a x + ad Gx b 0 +b x+b x + be geeratig fuctios. There are a umber of operatios that oe ca perform. Additio F x + Gx a 0 + b 0 + a + b x + a + b x + + a + b x +. Multiplicatio F x Gx a 0 b 0 + a 0 b + a b 0 x + a 0 b + a b + a b 0 x + + a 0 b + a b + a b 0 x +. Subtractio F x Gx a 0 b 0 + a b x + a b x + + a b x +. Multiplicatio by a scalar c F x ca 0 + ca x + ca x + + ca x +. Multiplicatio by x k x k F x a 0 x k + a x k+ + a x k+ + + a x +k +. Differetiatio d dx F x a +a x+3a x + ++a + x +. Itegratio F x dx C + a 0 x + a x + + a x +. Substitutig x k for x F x k a 0 +a x k +a x k + +a x k +. Substitutig cx for x F cx a 0 + a cx + a c x + a 3 c 3 x 3 + + a c x +.

Some basic geeratig fuctios There are some basic geeratig fuctios that we will use, may of which are derived from the geeratig fuctio x.. x + x + x + x 3 +.. x + x + x + x + + x. 3. +x x x + x x 3 + + x +. 4. x + x + x 4 + x 6 +. 5. x k + x k + x k + x 3k +. 6. +x k x k + x k x 3k + + x k +. 7. ax + ax + ax + ax 3 + + ax + a x + a 3 x 3 + + a x +. 8. x What is + x + 3x + 4x 3 + + + x + d dx x k? We kow k + x + x + k x x x. + x + x + + x + x + + x + x +. Whe we expad the above, every term x x x k i the expasio where + + 3 + + k, correspods to a partitio of ito k parts.. Theorem See ex. 9.6.5 text + k The umber of partitios of a positive iteger ito k parts equals. From the above theorem it follows that the coefficiet of x i + k equals. Thus we have that k + k x. x 0 k x

Example What is the coefficiet of x i k? x Solutio: Let y x. coefficiet of y i y The the coefficiet of x i k which is + k. x k equals the Aother useful formula is the followig: The biomial formula: x + y x y 0 + 0 x y + + x i y i + + i x 0 y. The covolutio property I may examples, oe is faced with the problem of fidig the geeratig fuctio for the umber of ways oe ca choose objects from differet sets. I geeral, the geeratig fuctio for choosig elemets from disjoit sets is the product of the geeratig fuctios for choosig from each set. Example Fid the geeratig fuctio for the umber of ways of distributig balls amog three distict cotaiers. Solutio: Let a be the umber of distributig balls ito the three cotaiers. We wat to fid F x for the geeratig fuctio F x a x. For ay cotaier, the geeratig fuctio for the umber of balls put ito the cotaier is Ax + x + x + x 3 +. Thus by the covolutio property, F x Ax 3 + x + x + x 3 + 3. To see this, he term x i i Ax represets puttig i balls ito a cotaier. If say 9 ad we put 3 balls i cotaier, ball i cotaier, ad 5 balls i cotaier 3, the we ca represet this combiatio by x 3 x x 5. The total umber of combiatios where we divide 9 balls ito three cotaiers is therefore the umber of terms x i x j x k where i + j + k 9. This is just the coefficiet of x 9 i the product Ax 3 + x + x + x 3 + + x + x + x 3 + + x + x + x 3 +. 3

3 Sice + x + x + x 3 + x, we see that F x x. x 3 Example How may ways ca we write the iteger as a sum of 5 positive odd itegers. Solutio: Let a be the umber of ways of doig this. Note that a 0 if is eve. Let F x be the geeratig fuctio for a. The geeratig fuctio for the odd itegers is Ax x + x 3 + x 5 +. Sice we are pickig 5 odd umbers, the covolutio property implies that F x Ax 5 x + x 3 + x 5 + x 7 + 5 x + x + x 4 + x 6 + 5 x 5 + x + x 4 + x 6 + 5 5 x 5 x. Thus we see that a is the coefficiet of x i x 5 5. x Therefore a equals the coefficiet of x 5 i 5 + 5 5 5 + 4 5. x 5. This coefficiet equals Example Fid the geeratig fuctio for the umber of ways a to write as a sum x + x + x 3 where x,, 3,..., x, 4, 6, 8,... ad x 3 3, 6, 9. Solutio: The geeratig fuctio for x is Ax x+x +x 3 + x. The geeratig fuctio for x is Bx x + x 4 + x 6 + x + x + x 4 + x. Ad the geeratig fuctio for x x 3 is Cx x 3 + x 6 + x 9. Thus the power series for a is F x AxBxCx x x x x3 + x 6 + x 9. Example Suppose we distribute balls amog four distict boxes so that each box has at least oe ball ad o more tha 8. Fid the geeratig 4

fuctio F x for the umber of ways a of doig this. Solutio: The geeratig fuctio Ax represetig the umber of balls oe ca put ito oe particular box is give by Ax x + x + + x 8 x + x + + x 7 x x8 x. Sice there are four boxes, the geeratig fuctio F x is therefore by the covolutio property x F x Ax 4 + x + + x 8 4 x 4 8 4. x I a umber of problems, fidig the coefficiets of a give geeratig fuctio ca be problematic. Oe importat method ivolves partial fractios. Example Fid the coefficiet of x i Gx x +x. Solutio: We shall use partial fractios. We eed to fid A, B, C, D such that x + x A x + B x + C + x + D + x. The above ca be rewritte as: A x + x + B + x + C x + x + D x. Whe x, we obtai 4B ad B 4. Whe x, we obtai 4D ad D 4. Whe x 0, we obtai A + C. Whe x, we obtai 3A C. Solvig the above two equatios for A ad C, we obtai that A B C D 4. Therefore, x + x 4 x + x + + x + + x. Now give that the coefficiet of x i each of x,, x +x, ad +x + + is,,, ad, respectively, we see that the coefficiet of x i equals x +x { + + + + + 0, if is odd; + 4, if is eve. 5

Example I how may ways ca we fill a bag with fruits if: the umber of applies is eve. the umber of baaas is a multiple of 5. there ca be at most 4 orages. there ca be at most pear. For example, there are 7 ways to fill a bag with 6 fruits as illustrated below. Applies 6 4 4 0 0 Baaas 0 0 0 0 0 5 5 Orages 0 4 3 0 Pears 0 0 0 0 0 Let a be the umber of ways of fillig the bag with fruits ad let F x be the geeratig fuctio for a. The geeratig fuctio Ax for the umber of apples is Ax +x +x 4 +x 6 +, the geeratig fuctio for the umber of baaas is Bx + x 5 + x 0 + x 5 +, the geeratig fuctio for the umber of orages is Cx + x + x + x 3 + x 4, ad the geeratig fuctio for the umber of pears is Dx + x. The the geeratig fuctio F x is give by F x AxBxCxDx + x + x 4 + x 6 + + x 5 + x 0 + + x + x + x 3 + x 4 + x x x 5 x5 + x x x. 6

Therefore, the coefficiet a i F x + is x +. So there are a + ways to fill a bag with fruits. + Note I the above calculatios, we used the fact that + x + x + x 3 + x 4 x 5 x. Example The Fiboacci sequece is the sequece a 0, a, a, a 3 3, a 4 5,... where for, a a + a. Fid the geeratig fuctio for this sequece. Solutio: The geeratig fuctio for this sequece is give by F x + x + x + 3x 3 + 5x 4 +. To fid what F x is explicitly, we use the relatio a a + a. Note that for the coefficiet of x i x F x is just a, ad for, the coefficiet of x i xf x is just a. Thus F x x x F x + xf x. Solvig for F x, we obtai that F x x x. 3 Exercises. Fid the geeratig fuctio for the umber of ways to divide cets ito peies, ickels, ad dimes.. Fid the geeratig fuctio for the umber of ways to select cady bars from 6 differet kids. How may ways ca oe select 0 bars? 3. Let m be a fixed positive itegers. Let a be the umber of ways to select, with repetitio allowed, from a collectio of m distict objects. Fid the geeratig fuctio for a. 4. Fid the coefficiet of x 7 i + x + x + x 3 + 5. 5. Fid the coefficiet of x 50 i x 7 + x 8 + x 9 + 6. 6. Fid the coefficiet of x 5 i each of the followig: a x 3 x 0. b x 3 5x x 3. 7

7. I how may ways ca a perso select marbles from a large supplly of blue, red, ad yellow marbles if the selectio must iclude a eve umber of blue marbles ad a odd umber of red oes? 8. $3,000 looies are divided ito piles of 5. Amog 4 eedy studet groups, the piles are divided so that each group gets at least 50 piles, but ot more tha, 000 piles. Use geeratig fuctios to fid out the umber of ways oe ca divide the piles. 9. Fid the geeratig fuctio for a 0, a,..., a,.... 0. Fid the coefficiet of x 005 i F x x +x.. Suppose that i a coutry there are cois of deomiatios, 3, 5, ad 7. Use geeratig fuctios to fid the umber of differet ways to pay exactly $0.. Suppose we have a sequece a, 0,,,... where a 0, ad a 3a for,, 3,.... Fid the geeratig fuctio for a. 3. Use geeratig fuctios to fid how may sequeces there are that satisfy the followig coditios: i The items of the sequece are the digits 0 9. ii The legth of the sequece is 6 eg 06030. iii Repetitios are allowed. iv The sum of the items is 0 eg. 3 8