![]() |
#1
|
|||
|
|||
![]()
I have a certain number of items, 26 (A-Z). I would like to find the number of possible combinations by splitting up 100% (1-100) among the 26 items.
Here are a couple of outcomes that would exist for example: Item Percentage A: 100 B-Z: 0 Item Percentage A: 99 B: 1 C-Z: 0 Item Percentage A: 98 B: 1 C: 1 D-Z: 0 Item Percentage A: 0 B: 15 C: 30 D-L: 0 M: 20 N: 25 O-Y: 0 Z: 10 Is there a formula to use to count the number of outcomes? I think it might be possible using nCr or nPr? |
|
|