Combinations
Unordered selections.
What does Combinations mean?
A combination is a way of selecting items from a larger set where the order of selection does not matter. For example, choosing 3 students from a class of 10 to form a committee — it doesn't matter who was picked first. Combinations are fundamental in probability, statistics, and combinatorics, and appear in everyday scenarios like lottery odds, team formation, and menu selections.
How to calculate Combinations
Combinations are calculated with the formula: C(n, r) = n! / (r! × (n − r)!), where n is the total number of items and r is the number of items to choose. For example, C(10, 3) = 10! / (3! × 7!) = 720 / 6 = 120. For comparison, the permutation formula P(n, r) = n! / (n − r)! counts ordered arrangements — P(10, 3) = 720, which is always greater than or equal to the combination count.
FAQ
Combinations count selections where order does not matter (e.g., choosing team members), while permutations count arrangements where order matters (e.g., assigning 1st, 2nd, 3rd place). For the same n and r, permutations are always greater than or equal to combinations because each combination can be arranged in r! different orders.
Use combinations when the order of selection is irrelevant — for example, choosing a committee, selecting lottery numbers, or picking toppings for a pizza. Use permutations when the arrangement or sequence matters — such as ranking contestants, assigning seats, or creating passwords.
Yes. If r = 0, there is exactly one way to choose nothing: C(n, 0) = 1. If n = 0 and r = 0, the result is also 1 by convention (0! = 1). However, r cannot be greater than n because you cannot choose more items than are available.
Lottery odds (e.g., choosing 6 numbers from 49), poker hands (5 cards from 52), forming committees or teams, selecting toppings from a menu, and choosing subjects to study from a list of electives are all everyday examples of combinations.
Factorials grow extremely fast. For standard floating-point numbers, n! overflows around n = 170. For most practical purposes with this calculator, values of n up to about 170 will produce accurate results. For larger values, specialized big-integer libraries are needed.
Related calculators
- Permutations— Ordered arrangements.
- Factorial— Product of descending integers.
- Probability— Likelihood of outcome.
- Ratio— Relative comparison of values.