Difference between revisions of "Generating function"

Revision as of 11:35, 6 July 2007

The idea behind generating functions is to create a power series whose coefficients, $c_0, c_1, c_2, \ldots$ , give the terms of a sequence which of interest. Therefore the power series (i.e. the generating function) is $c_0 + c_1 x + c_2 x^2 + \cdots$ and the sequence is $c_0, c_1, c_2,\ldots$ .

Simple Example

If we let $A(k)={n \choose k}$ , then we have ${n \choose 0}+{n \choose 1}x + {n \choose 2}x^2+\cdots+$ ${n \choose n}x^n$ .

This function can be described as the number of ways we can get $\displaystyle{k}$ heads when flipping $n$ different coins.

The reason to go to such lengths is that our above polynomial is equal to $(1+x)^n$ (which is clearly seen due to the Binomial Theorem). By using this equation, we can rapidly uncover identities such as ${n \choose 0}+{n \choose 1}+...+{n \choose n}=2^n$ (let ${x}=1$ ), also ${n \choose 1}+{n \choose 3}+\cdots={n \choose 0}+{n \choose 2}+\cdots$ .

Page

Toolbox

Search

Difference between revisions of "Generating function"

Revision as of 11:35, 6 July 2007

Simple Example

See also

Revision as of 18:12, 12 August 2006 (view source) Joml88 (talk \| contribs) ← Older edit	Revision as of 11:35, 6 July 2007 (view source) JBL (talk \| contribs) m (Generating functions moved to Generating function: in keeping with general principle) Newer edit →
(No difference)