Transcription of 12 Generating Functions - MIT OpenCourseWare
{{id}} {{{paragraph}}}
Example: tourism industry
12 Generating Functions - MIT OpenCourseWare
Mcs-ftl 2010/9/8 0:40 page 355 #36112 Generating FunctionsGenerating Functions are one of the most surprising and useful inventions in Dis-crete Math. Roughly speaking, Generating Functions transform problems aboutse-quencesinto problems aboutfunctions. This is great because we ve got piles ofmathematical machinery for manipulating Functions . Thanks to Generating func-tions, we can then apply all that machinery to problems about sequences. In thisway, we can use Generating Functions to solve all sorts of counting problems. Theycan also be used to find closed-form expressions for sums and to solve fact, many of the problems we addressed in Chapters 9 11 can be formulatedand solved using Generating Definitions and ExamplesTheordinary Generating functionfor the sequence1hg0;g1;g2;g3:::iis the :There are a few other kinds of Generating Functions in common use, but ordinarygenerating Functions are enough to illustrate the power of the idea, so we ll stick tothem and from now on, Generating functionwill mean the ordi
can also be used to find closed-form expressions for sums and to solve recurrences. In fact, many of the problems we addressed in Chapters 9–11 can be formulated and solved using generating functions. 12.1 Definitions and Examples The ordinary generating function for the sequence1 hg0;g1;g2;g3:::iis the power series: G.x/Dg0Cg1xCg2x2Cg3x3C :
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: