Generating function
In mathematics a generating function is a formal power series whose coefficients encode information about a sequence an that is indexed by the natural numbers.
Related Topics:
Mathematics - Formal power series - Sequence - Natural number
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series; definitions and examples are given below. Every sequence has a generating function of each type. The particular generating function that is most useful in a given context will depend upon the nature of the sequence and the details of the problem being addressed.
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
Generating functions are often expressed in closed form as functions of a formal argument x. Sometimes a generating function is evaluated at a specific value of x. However, it must be remembered that generating functions are formal power series, and they will not necessarily converge for all values of x.
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
~ Table of Content ~
| ► | Introduction |
| ► | Definitions |
| ► | Examples |
| ► | Another example |
| ► | More detailed example — Fibonacci numbers |
| ► | Applications |
| ► | See also |
| ► | References |
| ► | External links |
~ What's Hot ~
~ Community ~
| ► | History Forum Come and discuss about History, Civilizations, Historical Events and Figures |
| ► | History Web-Ring A community of sites, blogs and forums dedicated to History. Do not hesitate to submit your site. |
and are licensed under the GNU Free Documentation License.
Lexicon - Privacy Policy - Spiritus-Temporis.com ©2005.