Combinations with replacement (also called multiset coefficients) count the number of ways to choose k items from n types when you can repeat items and order does not matter. Formula: C(n+k-1, k) = (n+k-1)! / (k!(n-1)!)
💡
Pro Tip
Think of it as distributing k identical balls into n distinct bins: how many distributions are possible? The formula C(n+k-1, k) gives the answer.
⭐
Did You Know?
Combinations with replacement appear in number theory as 'stars and bars' problems, in physics for counting quantum states of identical particles (bosons), and in combinatorics textbooks as the 'ice cream flavor' problem.
References
🔒
100% Miễn phí
Không cần đăng ký
✓
Chính xác
Công thức đã xác minh
⚡
Tức thì
Kết quả khi nhập
📱
Sẵn sàng di động
Mọi thiết bị