What Is a Combination Calculator?

A Combination Calculator is a combinatorics tool that calculates how many ways you can choose a group of items from a larger set when order does not matter. The standard combination value is written as \(\binom{n}{r}\), \(nCr\), or \(C(n,r)\). It answers questions such as: how many committees of 3 can be chosen from 10 people, how many 5-card hands can be drawn from a 52-card deck, how many lottery tickets are possible when choosing 6 numbers from 49, or how many terms appear in a binomial expansion row.

Combinations are used in probability, statistics, algebra, discrete mathematics, computer science, data science, genetics, card games, lottery odds, tournament planning, survey sampling, experimental design, binomial theorem, Pascal's triangle, and many school math topics. A combination is different from a permutation. In a combination, the order of chosen items does not matter. Choosing Alice, Ben, and Cara is the same group as choosing Cara, Alice, and Ben. In a permutation, order matters, so those arrangements would be counted separately.

This calculator includes multiple combination tools. The standard \(nCr\) mode calculates ordinary combinations without repetition. The repetition mode calculates selections where an item type can be chosen more than once. The comparison mode shows both combinations and permutations so you can see how much order changes the count. The lottery mode calculates total possible tickets and odds of matching all selected numbers. The hypergeometric mode calculates the probability of exactly, at least, or at most a certain number of successes when sampling without replacement. The Pascal row mode generates binomial coefficients. The team selection mode handles required and excluded people in committee problems.

The calculator also provides formulas, exact values when practical, approximate logarithmic information, probability values, odds, and step-by-step tables. It is designed for students who need help learning the concept and for users who need quick accurate counts.

How to Use This Combination Calculator

Use the nCr tab for the most common combination problem. Enter the total number of items as \(n\) and the number chosen as \(r\). The calculator returns \(\binom{n}{r}\), which is the number of unordered selections. This is the correct mode when order does not matter and items cannot repeat.

Use With Repetition when selections can repeat. For example, choosing 3 scoops of ice cream from 5 flavors allows the same flavor more than once. The formula becomes \(\binom{n+r-1}{r}\). This is sometimes called combinations with replacement or multiset combinations.

Use nCr vs nPr when you are not sure whether the problem is a combination or permutation. If order matters, use \(nPr\). If order does not matter, use \(nCr\). The calculator shows both values and explains the difference. This is useful because many probability errors come from counting arrangements when you should count selections, or counting selections when you should count arrangements.

Use Lottery Odds when a game asks you to choose \(k\) numbers from a pool of \(N\). The total number of tickets is \(\binom{N}{k}\). If one ticket wins, the probability of one ticket matching all numbers is \(1/\binom{N}{k}\). If you play multiple unique tickets, the approximate chance is tickets divided by total combinations, assuming no duplicate tickets and a single winning combination.

Use Hypergeometric when drawing without replacement and counting successes. This mode is useful for card probability, lottery matching, quality control, and sampling from a finite population. Use Pascal Row to generate binomial expansion coefficients. Use Team Selection when certain people must be included or excluded from a committee.

Combination Formulas

The standard combination formula is:

where \(n\) is the total number of items and \(r\) is the number chosen.

The permutation formula is:

The relationship between permutations and combinations is:

Combinations with repetition are calculated by:

Hypergeometric probability is:

The binomial theorem uses combination coefficients:

The symmetry property of combinations is:

Combinations vs Permutations

The most important question in a counting problem is: does order matter? If order does not matter, use combinations. If order matters, use permutations. For example, choosing 3 students from 10 for a committee is a combination because Alice-Ben-Cara is the same committee as Cara-Ben-Alice. But choosing president, vice president, and secretary from 10 students is a permutation because the roles are different.

Permutations are usually larger than combinations because every selected group can be arranged in \(r!\) different orders. That is why \(^nP_r=\binom{n}{r}r!\). A common mistake is using permutations for lottery tickets or card hands. In most lottery games, the order of numbers does not matter, so combinations are used. In a race result, order matters, so permutations are used.

Combinations with Repetition

Combinations with repetition occur when the same type can be selected more than once. Suppose an ice cream shop has 5 flavors and you choose 3 scoops. If repeated flavors are allowed, vanilla-vanilla-chocolate is possible. Since order does not matter, vanilla-vanilla-chocolate is the same as chocolate-vanilla-vanilla. This is not ordinary \(\binom{5}{3}\), because ordinary combinations do not allow repeated selected items.

The formula for combinations with repetition is \(\binom{n+r-1}{r}\). It comes from the “stars and bars” method. The \(r\) selected items are stars, and the \(n-1\) dividers separate categories. This idea appears in algebra, probability, computer science, integer solutions, and distribution problems.

Lottery Odds and Matching Probability

Lottery odds are classic combination problems. If a game asks you to choose 6 numbers from 49, the total number of possible tickets is \(\binom{49}{6}\). If there is one winning set of 6 numbers, the probability of one ticket matching all 6 is \(1/\binom{49}{6}\). The odds are large because the number of possible combinations is large.

Lottery matching problems can also use the hypergeometric distribution. If the winning set has 6 numbers and your ticket has 6 numbers from a pool of 49, the probability of matching exactly 3 numbers is \(\binom{6}{3}\binom{43}{3}/\binom{49}{6}\). This calculator includes a hypergeometric mode for exactly, at least, or at most a number of matches.

Pascal's Triangle and Binomial Coefficients

Pascal's triangle is a triangular arrangement of combination values. Row \(n\) contains \(\binom{n}{0},\binom{n}{1},\binom{n}{2},\ldots,\binom{n}{n}\). These values are also the coefficients in the expansion of \((a+b)^n\). For example, row 4 is 1, 4, 6, 4, 1, so \((a+b)^4=a^4+4a^3b+6a^2b^2+4ab^3+b^4\).

Pascal's triangle makes several combination patterns visible. Rows are symmetric because \(\binom{n}{r}=\binom{n}{n-r}\). The sum of row \(n\) is \(2^n\). Each interior value is the sum of two values above it. These patterns connect algebra, probability, counting, and binomial distributions.

Team and Committee Selection

Team selection problems often add restrictions. If a committee must include certain people, include them first and then choose the remaining spots from the remaining eligible people. For example, if 1 person must be included on a 5-person team from 20 people, then you need to choose 4 more people from the remaining 19, giving \(\binom{19}{4}\).

If some people are excluded, remove them from the available pool before calculating. If required people are greater than the team size, the number of possible teams is zero. If exclusions reduce the available pool too much, the result is also zero. The calculator handles these constraints directly.

Combination Worked Examples

Example 1: Standard combination. How many ways can you choose 3 people from 10?

Example 2: Combination with repetition. How many ways can you choose 3 scoops from 5 flavors if repeated flavors are allowed?

Example 3: Permutation comparison. If 3 people are selected from 10 and assigned different roles, then order matters:

The permutation count is larger than \(\binom{10}{3}=120\) because each group of 3 can be arranged in \(3!=6\) ways.

Example 4: Lottery odds. Choosing 6 numbers from 49 gives:

So one ticket has probability \(1/13,983,816\) of matching all numbers, assuming one winning combination and no other game rules.

Common Combination Mistakes

The first common mistake is using permutations when combinations are needed. If order does not matter, do not count different orders as different outcomes. The second mistake is using ordinary combinations when repetition is allowed. If items can repeat, use \(\binom{n+r-1}{r}\), not \(\binom{n}{r}\).

The third mistake is forgetting restrictions in committee problems. Required people should be included first; excluded people should be removed first. The fourth mistake is treating lottery odds as if each number position is ordered. In most lottery games, the set of selected numbers matters, not the order in which they are drawn.