How does the calculation change if the number of allowed balls per colour is constrained? For example, when there are 5 red balls, 3 yellow balls and 2 green balls, picking seven balls could never yield more than 5 reds, 3 yellows or 2 greens. I'm guessing this would be solved algorithmically, but where should I look to find such an algorithm or to come up with an efficient one myself?
he is describing a scenario wherr we just record the colour of the ball and repeat the process again, not taking out. For taking out, the events become dependent on what happened before, hence you yourself have to come up with an algo to solve that. It is not that hard.
awesoem explanation
Thanks MIT
Great video! Thank you!
How does the calculation change if the number of allowed balls per colour is constrained? For example, when there are 5 red balls, 3 yellow balls and 2 green balls, picking seven balls could never yield more than 5 reds, 3 yellows or 2 greens. I'm guessing this would be solved algorithmically, but where should I look to find such an algorithm or to come up with an efficient one myself?
he is describing a scenario wherr we just record the colour of the ball and repeat the process again, not taking out. For taking out, the events become dependent on what happened before, hence you yourself have to come up with an algo to solve that. It is not that hard.
Probably similar to a combination to the video before this one ("each player gets an ace").
Thank you, this is great!
that was amazing!