- #1
MartinWDK
- 2
- 0
Dear all,
We are trying to compute the number of ways for a computer to execute concurrent processes.
It appears that this problem is equivalent to asking the following:
Assume that an urn is filled with different quantities of differently colored balls. There are k different colors, and the number of balls of a given color is denoted nk.
Balls are drawn from the urn it is empty, and the color of the drawn ball is noted.
The question is: how many different color sequences can be constructed in this way?
Thank you,
Martin
We are trying to compute the number of ways for a computer to execute concurrent processes.
It appears that this problem is equivalent to asking the following:
Assume that an urn is filled with different quantities of differently colored balls. There are k different colors, and the number of balls of a given color is denoted nk.
Balls are drawn from the urn it is empty, and the color of the drawn ball is noted.
The question is: how many different color sequences can be constructed in this way?
Thank you,
Martin