Dear all,(adsbygoogle = window.adsbygoogle || []).push({});

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 arekdifferent colors, and the number of balls of a given color is denotedn._{k}

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

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Urn Problem

Loading...

Similar Threads - Problem | Date |
---|---|

I The Halting Problem | Today at 4:16 AM |

B Problem in Counting - Number of Passwords | Feb 23, 2018 |

I A specific combination problem | Feb 6, 2018 |

I A seemingly simple problem about probability | Jan 29, 2018 |

I Extension of Turing computable | Nov 14, 2017 |

**Physics Forums - The Fusion of Science and Community**