Difference between revisions of "Generating function"
ComplexZeta (talk | contribs) |
|||
| Line 1: | Line 1: | ||
| − | The idea behind generating functions is to represent a [[ | + | The idea behind generating functions is to represent a [[combinatorics|combinatorial]] [[function]] <math>A(k)</math> in terms of a [[polynomial function]] which is equivalent for all purposes. This function is:<br> |
<math>A(0)+A(1)x+A(2)x^2+A(3)x^3+...</math><br>where the coefficient <math>A(k)</math> of <math>x^k</math> is the number of ways an event ''k'' can occur. | <math>A(0)+A(1)x+A(2)x^2+A(3)x^3+...</math><br>where the coefficient <math>A(k)</math> of <math>x^k</math> is the number of ways an event ''k'' can occur. | ||
Revision as of 10:00, 19 June 2006
The idea behind generating functions is to represent a combinatorial function 
in terms of a polynomial function which is equivalent for all purposes. This function is:
where the coefficientof
is the number of ways an event k can occur.
is the number of ways an event k can occur.
Simple Example
If we let 
then we have:
This function can be described as the number of ways we can get k heads when flipping n different coins.
The reason to go to such lengths is that our above polynomial is equal to 
(which is clearly seen due to the Binomial Theorem). By using this equation, we can rapidly uncover identities such as 
(plug in 1 for x), also 
