Namespaces
Variants
Actions

Denumerant

From Encyclopedia of Mathematics
Revision as of 17:17, 7 February 2011 by 127.0.0.1 (talk) (Importing text file)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

The number of partitions of an integer into parts equal to , i.e. the number of solutions in non-negative integers of the equation

The generating function of the denumerants is

The simplest method of computing a denumerant is by Euler's recurrence relation:

Explicit formulas for certain denumerants may be obtained from the following theorem: If is the least common multiple of the numbers , then the denumerant

is a polynomial of degree with respect to .

References

[1] J. Riordan, "An introduction to combinational analysis" , Wiley (1958)
How to Cite This Entry:
Denumerant. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Denumerant&oldid=16405
This article was adapted from an original article by V.E. Tarakanov (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article