What Is a Combination Calculator?

A Combination Calculator is a counting tool that finds how many ways you can choose a smaller group of items from a larger set when the order of selection does not matter. The most common notation is \(nCr\), \(C(n,r)\), or \(\binom{n}{r}\). Each notation means choose \(r\) items from \(n\) total items.

For example, suppose you have 10 students and need to choose 3 for a team. If the team has no ranking, then choosing A, B, C is the same as choosing C, B, A. That is a combination problem because order does not matter. The number of possible teams is \(\binom{10}{3}=120\).

Combinations appear in probability, statistics, algebra, discrete math, lottery calculations, card games, committees, scheduling, experimental design, genetics, computer science, sampling, and everyday selection problems. They are also used inside formulas such as the binomial distribution, where \(\binom{n}{x}\) counts how many ways \(x\) successes can occur in \(n\) trials.

This calculator supports two major types: standard combinations without repetition and combinations with repetition. Standard combinations assume each item can be selected only once. Combinations with repetition allow the same type of item to be selected again, such as choosing scoops of ice cream where flavors may repeat.

How to Use the Combination Calculator

Enter the total number of items in the \(n\) field. This is the size of the full set. Then enter the number of items chosen in the \(r\) field. For standard combinations, \(r\) cannot be larger than \(n\), because you cannot choose more unique items than exist in the set.

Choose Without repetition for normal \(nCr\) problems. Use this for teams, committees, card hands, lottery selections without repeated numbers, and choosing unique items. Choose With repetition when repeated selections are allowed, such as selecting several items from categories where the same category can be chosen multiple times.

Click Calculate Combination. The calculator returns the number of combinations, the formula used, factorial values, complementary combination, and step-by-step work. The related-value chips show nearby combination values to help users see how the count changes as \(r\) changes.

Combination Calculator Formulas

The standard combination formula is:

In this formula, \(n\) is the total number of items, \(r\) is the number of items chosen, and the exclamation mark means factorial. A factorial multiplies all positive whole numbers down to 1:

The special value \(0!\) is defined as 1:

For combinations with repetition, the formula is:

The complement identity is useful because choosing \(r\) items to include is equivalent to choosing \(n-r\) items to leave out:

Combination vs Permutation

The difference between combinations and permutations is order. In combinations, order does not matter. In permutations, order matters. If you choose three students for an unranked committee, that is a combination. If you choose a president, vice president, and secretary, that is a permutation because each role is different.

For the same \(n\) and \(r\), permutations usually produce a larger number than combinations because every ordering is counted separately. The permutation formula is \(P(n,r)=\frac{n!}{(n-r)!}\). The combination formula divides by \(r!\) because the \(r!\) internal orderings of the chosen group should not be counted separately.

Example: choosing 3 people from 10 gives \(\binom{10}{3}=120\) combinations. Arranging 3 people from 10 into first, second, and third roles gives \(P(10,3)=720\) permutations. The permutation count is 6 times larger because 3 selected people can be arranged in \(3!=6\) orders.

Combinations With Repetition

Combinations with repetition are used when each selected item can be chosen more than once and order still does not matter. For example, if an ice cream shop has 5 flavors and you choose 3 scoops, you might choose chocolate, chocolate, vanilla. Since repeated flavors are allowed and order of scoops does not matter, this is a combination with repetition problem.

The formula is \(\binom{n+r-1}{r}\). This formula comes from a counting technique often called stars and bars. The selected items are represented by stars, and separators divide them among categories. While the derivation can feel abstract, the calculator handles the arithmetic directly and shows the substitution.

For example, choosing 3 scoops from 5 flavors with repetition gives \(\binom{5+3-1}{3}=\binom{7}{3}=35\). That means there are 35 unordered scoop combinations when repeated flavors are allowed.

Common Applications of Combinations

Combinations are used in lottery probability, card games, team selection, committee formation, survey sampling, quality control, experimental design, genetics, and probability distributions. In card games, a 5-card hand from a 52-card deck is a combination because the order in which the cards are dealt does not change the final hand.

In statistics, combinations appear in the binomial distribution. The term \(\binom{n}{x}\) counts how many ways \(x\) successes can happen among \(n\) trials. In research, combinations can count how many possible samples or groups can be formed. In business, combinations can count bundles, packages, or possible feature selections when order is irrelevant.

Combinations also help students develop counting logic. Instead of listing every possible group manually, the formula gives a systematic method for counting large selection problems.

Combination Calculator Worked Examples

Example 1: Choose 3 items from 10 items.

Example 2: Choose 5 cards from a 52-card deck.

Example 3: Choose 6 lottery numbers from 49 numbers.

Example 4: Choose 3 scoops from 5 flavors with repetition allowed.

Common Combination Mistakes

The first common mistake is using combinations when order actually matters. If positions, rankings, passwords, arrangements, or ordered outcomes are involved, the problem may require permutations instead.

The second mistake is allowing \(r\) to be larger than \(n\) in standard combinations. Without repetition, you cannot choose more unique objects than the number available. With repetition, \(r\) can be larger than \(n\) because repeated choices are allowed.

The third mistake is forgetting that \(0!=1\). This matters when \(r=0\) or \(r=n\). In both cases, there is exactly one way to choose: choose nothing or choose everything.

The fourth mistake is not simplifying the factorial expression. Large factorials become enormous quickly, but many terms cancel. For example, \(\binom{10}{3}=\frac{10\times9\times8}{3\times2\times1}\), not a calculation that requires fully expanding all of \(10!\) and \(7!\).