Combination Calculator

In combinatorics, a combination represents the selection of items from a larger pool where order has no significance. The standard mathematical formula for combinations (often read as "n choose r") is expressed as C(n,r) = n! / (r! * (n - r)!), where 'n' is the total number of items available, 'r' is the number of items to choose, and '!' denotes a factorial. When repetition is allowed, the formula shifts to C(r + n - 1, r) = (n + r - 1)! / (r! * (n - 1)!), allowing the same item to be selected multiple times.

Imagine you are forming a committee of 3 people from a club of 7 eligible members, and you want to know how many unique committees can be formed. Here, our total items n = 7 and our selection size r = 3. Plugging these values into the combination formula, we get C(7,3) = 7! / (3! * (7 - 3)!). This simplifies to 7! / (3! * 4!). Expanding the factorials gives us (7 * 6 * 5 * 4!) / ((3 * 2 * 1) * 4!). Canceling out the 4! from numerator and denominator leaves us with (7 * 6 * 5) / (210 / 6), which equals 35. Therefore, there are exactly 35 unique committees you can form.

Always verify whether your problem requires order to matter before using a combination formula; if sequence is important, use a permutation calculator instead. Be mindful of factorial growth, as numbers larger than 50 can produce massive results that exceed standard integer limits, requiring scientific notation or mantissa-exponent formatting. When dealing with replacement scenarios, double-check whether items can be chosen more than once to apply the correct repetition formula.