Difference between revisions of "Ball-and-urn"
m (→Reasoning (One of Several): Fixed error in example. changed r_3 to r_2) |
(→Reasoning (One of Several)) |
||
Line 3: | Line 3: | ||
It is used to solve problems of the form: how many ways can one distribute <math>k</math> indistinguishable objects into <math>n</math> bins? We can imagine this as finding the number of ways to drop <math>k</math> balls into <math>n</math> urns, or equivalently to drop <math>k</math> balls amongst <math>n-1</math> dividers. The number of ways to do such is <math>{n+k-1 \choose k}</math>. | It is used to solve problems of the form: how many ways can one distribute <math>k</math> indistinguishable objects into <math>n</math> bins? We can imagine this as finding the number of ways to drop <math>k</math> balls into <math>n</math> urns, or equivalently to drop <math>k</math> balls amongst <math>n-1</math> dividers. The number of ways to do such is <math>{n+k-1 \choose k}</math>. | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
== Problems == | == Problems == |
Revision as of 18:46, 8 February 2016
The ball-and-urn technique, also known as stars-and-bars, is a commonly used technique in combinatorics.
It is used to solve problems of the form: how many ways can one distribute indistinguishable objects into bins? We can imagine this as finding the number of ways to drop balls into urns, or equivalently to drop balls amongst dividers. The number of ways to do such is .