Here is a question regarding combinatorics. I'm cross posting it
to sci.math.probability because any combinatorics probablem speaks
to the issue of probability which I'm interested in.
How many ways are there to partition a number N into a number of
smaller nonzero numbers arranged in decending order of value. For
example,
N=6, the answer would seem to be 11.
Partitions are as follows.
1 1 1 1 1 1
2 1 1 1 1
2 2 1 1
2 2 2
3 1 1 1
3 2 1
3 3
4 1 1
4 2
5 1
6
Actually, it doesn't matter if the order is ascending or
descending, as long as you use the same order throughout
the list. Thanks in advance.
