Combinations with repetition

The calculator finds the number of combinations of the k-th class from n elements with repetition. A combination with repetition of k objects from n is a way of selecting k objects from a list of n. The order of selection does not matter and each object can be selected more than once (repeated).

(n)
(k)

Calculation:

Ck′​(n)=(kn+k−1​)  n=10 k=4  C4′​(10)=C4​(10+4−1)=C4​(13)=(413​)=4!(13−4)!13!​=4⋅3⋅2⋅113⋅12⋅11⋅10​=715

The number of combinations with repetition: 715



A bit of theory - the foundation of combinatorics

Combinations with repetition

Here we select k-element groups from n elements, regardless of order, where elements can be repeated. k is generally greater than n (otherwise we would obtain ordinary combinations). The count is:

Ck′​(n)=(kn+k−1​)=k!(n−1)!(n+k−1)!​

Explanation of the formula: the number of combinations with repetition equals the number of ways to place n − 1 separators among n − 1 + k positions. A typical example: we go to a store to buy 6 chocolates. There are only 3 types available. How many different selections can we make? k = 6, n = 3.

Foundation of combinatorics in word problems



more math problems »