Combination Calculator

Combinations and permutations answer one of the most practical questions in probability and discrete mathematics: in how many ways can a selection be made? The distinction between the two matters enormously. Permutations count arrangements where order matters — the PIN 4-7-2-1 is different from 1-2-7-4. Combinations count selections where order doesn't matter — a 5-card poker hand containing the same five cards in any dealt order is the same hand. Getting this distinction right is the first step in any counting problem, and the formula follows directly from it.

Combinations with Repetition

Standard combinations don't allow an item to be chosen more than once. Combinations with repetition — also called multisets — allow repeated selection. The formula for selecting k items from n types with repetition allowed: C(n+k-1, k). Choosing 3 ice cream flavors from 12 available, allowing repeats (e.g., chocolate, chocolate, vanilla is valid): C(12+3-1, 3) = C(14, 3) = 364 options. Without repetition: C(12,3) = 220. Repetition significantly expands the count.

This formula appears in probability (the stars and bars method in combinatorics), in determining the number of non-negative integer solutions to equations, and in some sampling problems where replacement is allowed. The stars and bars framework: imagine distributing k identical balls into n distinct boxes, where each box can hold any number of balls. The answer is C(n+k-1, k) — the same formula as combinations with repetition.

Combinations in Probability Distributions

The binomial distribution — the probability distribution for a fixed number of yes/no trials — uses the combination formula as its core coefficient. P(X = k) = C(n,k) × p^k × (1-p)^(n-k), where n is the number of trials, k is the number of successes, and p is the probability of success on each trial. The combination C(n,k) counts how many ways you can get exactly k successes in n trials, and the probability calculation weights each combination by its likelihood.

A manufacturing quality check: 15 parts tested, each has a 4% defect rate. What's the probability exactly 2 are defective? P(X=2) = C(15,2) × (0.04)^2 × (0.96)^13 = 105 × 0.0016 × 0.5921 = 105 × 0.000947 = 0.0995 — approximately a 9.95% probability. The combination value 105 represents all the ways 2 defective parts can occur among 15 tested. Without the combination formula embedded in the binomial distribution, this calculation is impossible to structure.

The Combination Formula

The number of ways to choose k items from a set of n items without regard to order is written C(n,k) or "n choose k" and calculated as: C(n,k) = n! ÷ (k! × (n-k)!). The exclamation mark is factorial notation: 5! = 5 × 4 × 3 × 2 × 1 = 120. So C(8,3) — choosing 3 items from 8 — equals 8! ÷ (3! × 5!) = 40,320 ÷ (6 × 120) = 40,320 ÷ 720 = 56. There are 56 different ways to choose any 3 items from a group of 8.

The permutation formula for comparison: P(n,k) = n! ÷ (n-k)!. P(8,3) = 8! ÷ 5! = 40,320 ÷ 120 = 336. The 336 permutations versus 56 combinations makes intuitive sense: for every combination (every distinct selection of 3 items), there are 3! = 6 different orderings of those same 3 items. So 56 × 6 = 336. Combinations are always smaller than permutations for the same n and k, because combinations divide out all the orderings that permutations count separately.

Real-World Applications of Combination Calculations

Lotteries are the most familiar application. A standard 6/49 lottery draws 6 winning numbers from 49 without regard to order. C(49,6) = 49! ÷ (6! × 43!) = 13,983,816 possible combinations. The probability of matching all 6 numbers is 1 in 13,983,816 — roughly 1 in 14 million. Compare to Powerball: choose 5 from 69 white balls [C(69,5) = 11,238,513] and separately 1 from 26 red balls. Combined odds: 11,238,513 × 26 = 292,201,338 — roughly 1 in 292 million. The separate red ball draws reduces it from a pure combination problem to a compound probability problem.

Committee formation is another common application. A department of 15 people needs to select a committee of 4 members. C(15,4) = 15! ÷ (4! × 11!) = 1,365 different committees are possible. But if the committee needs a designated chair and secretary (positions with different roles), order matters for those two positions — then you'd calculate permutations for the leadership selection and combinations for the remaining members.

Pascal's Triangle and Combination Identities

Pascal's triangle is a visual representation of combination values where each entry is the sum of the two entries above it. Row 0 is just 1. Row 1 is 1, 1. Row 2 is 1, 2, 1. Row 3 is 1, 3, 3, 1. Row 4 is 1, 4, 6, 4, 1. The entries in row n reading left to right are C(n,0), C(n,1), C(n,2), ..., C(n,n). Row 4: C(4,0)=1, C(4,1)=4, C(4,2)=6, C(4,3)=4, C(4,4)=1. Pascal's triangle enables rapid calculation of combination values by building from smaller known values rather than computing factorials directly for each case.

The binomial theorem connects combinations to algebra: (a+b)^n = sum from k=0 to n of C(n,k) × a^(n-k) × b^k. The expansion of (x+1)^5 = C(5,0)x^5 + C(5,1)x^4 + C(5,2)x^3 + C(5,3)x^2 + C(5,4)x + C(5,5) = x^5 + 5x^4 + 10x^3 + 10x^2 + 5x + 1. The coefficients 1, 5, 10, 10, 5, 1 are exactly row 5 of Pascal's triangle. This connection between counting and algebra makes combinations essential in statistics, probability theory, and polynomial mathematics.

Calculating Large Combinations Without Factorial Overflow

Direct factorial calculation becomes impractical for large n. C(52,5) — the number of 5-card poker hands from a 52-card deck — uses factorials up to 52!. Calculators handle this, but hand calculations benefit from simplification before multiplying. The key shortcut: cancel common factors between numerator and denominator.

C(52,5) = (52 × 51 × 50 × 49 × 48) ÷ (5 × 4 × 3 × 2 × 1). The numerator is the product of n descending from the top for k terms; the denominator is k!. Numerator: 52 × 51 × 50 × 49 × 48 = 311,875,200. Denominator: 120. Result: 311,875,200 ÷ 120 = 2,598,960. There are 2,598,960 distinct 5-card poker hands. Of these, 4 are royal flushes — giving a royal flush probability of 4 ÷ 2,598,960 = approximately 1 in 649,740 hands dealt.

Brandon, 25, studying for his statistics exam in Denver, Colorado uses this shortcut for large combinations: always simplify the ratio before multiplying. For C(100, 3): don't compute 100!. Instead compute (100 × 99 × 98) ÷ (3 × 2 × 1) = 970,200 ÷ 6 = 161,700. The numerator has only k terms (3 in this case), not n terms — making hand calculation tractable even for large n.