|
combinat[numbpart] - The number of partitions of an integer
|
|
Calling Sequence
|
|
numbpart(n, m)
|
|
|
Parameters
|
|
|
n
|
-
|
non-negative integer; integer to partition
|
|
m
|
-
|
(optional) non-negative integer; maximum integer in partitions
|
|
|
|
|
|
Description
|
|
|
•
|
This procedure counts the number of partitions of an integer n, that is, the number of ways n can be split into sums without regard to order.
|
|
•
|
See the partition function that constructs the partitions. Note that numbpart(n) = nops(partition(n)) for  .
|
|
•
|
The command with(combinat,numbpart) allows the use of the abbreviated form of this command.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
![[[1, 1, 1, 1, 1], [1, 1, 1, 2], [1, 2, 2], [1, 1, 3], [2, 3], [1, 4], [5]]](/support/helpjp/helpview.aspx?si=7026/file03555/math84.png)
| (2) |
|
>
|
|
|
| (3) |
|
>
|
|
|
![[[1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 2], [1, 1, 2, 2], [2, 2, 2], [1, 1, 1, 3], [1, 2, 3], [3, 3]]](/support/helpjp/helpview.aspx?si=7026/file03555/math98.png)
| (4) |
|
|
Download Help Document
Was this information helpful?
