|
|
|
|
|Store|
|
|
|
|
CTK Exchange
CJ
guest
|
Mar-07-05, 01:08 PM (EST) |
|
"Combinatorics using interger partitions"
|
I have two questions. Is there any easy way to fill in the P(m,n) table all the way up to m and n equal to 10? Here is what I have based on what my book tells me. m/n 1 2 3 4 5 6 7 8 1 1 0 0 0 0 0 0 0 2 1 1 0 0 0 0 0 0 3 1 1 1 0 0 0 0 0 4 1 2 1 1 0 0 0 0 5 1 2 2 1 1 0 0 0 6 1 3 3 2 1 1 0 0 7 1 3 4 3 2 1 1 0 8 1 4 5 5 3 2 1 1 9 1 4 7 6 5 3 2 1 10 1 5 8 9 7 5 3 2 For P(1,9) to P(8,9) and P(1,10) to P(9,10)I have zero and the other values as 1.The second problem involves putting 15 ideniccal apples into 5 identical bags so that each bag has at least 2 apples what do I need to use to solve this problem? |
|
Alert | IP |
Printer-friendly page |
Reply |
Reply With Quote | Top |
|
|
You may be curious to have a look at the old CTK Exchange archive. Please do not post there.
|Front page|
|Contents|
Copyright © 1996-2018 Alexander Bogomolny
|
|