Combination Calculator: Does Order Matter?

No, order does not matter in a combination. A combination is a selection of items where the arrangement is irrelevant; choosing A, B, C is the same as C, B, A. This calculator computes the number of ways to choose r items from a set of n items without regard to order, using the formula nCr = n! / (r! × (n−r)!).

Formula

The combination formula counts selections where order does not matter:

C(n, r) = n! / (r! × (n − r)!)

• n = total number of distinct items (unit: count)
• r = number of items chosen (unit: count)
• ! = factorial, meaning multiply all positive integers from 1 up to that number (e.g., 5! = 5 × 4 × 3 × 2 × 1 = 120)

The result is a count of distinct groups, with no repeated groups and no internal ordering.

Worked Example

Using the default values: n = 10 items total, r = 3 chosen.

1. Compute 10! = 10 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 3,628,800
2. Compute 3! = 3 × 2 × 1 = 6
3. Compute (10 − 3)! = 7! = 7 × 6 × 5 × 4 × 3 × 2 × 1 = 5,040
4. Plug into the formula: 3,628,800 / (6 × 5,040) = 3,628,800 / 30,240 = 120

The calculator returns 120 combinations. It also shows 720 permutations for comparison (10! / 7! = 720), which counts the same 3 items in every possible order.

When to Use Combinations vs. Permutations

Use a combination when the arrangement of the chosen items is irrelevant. Common real-world examples:

• Choosing 3 toppings from a menu of 10 – “pepperoni, mushroom, oliveâ€� is the same pizza as “olive, pepperoni, mushroomâ€�.
• Selecting a committee of 4 from 12 people – the committee is the same group regardless of the order members are listed.
• Drawing 5 cards from a deck – the hand is the same set of cards no matter the order you receive them.

Use a permutation when order matters, such as:

• Assigning 3 different roles (president, treasurer, secretary) from 10 candidates – the same three people in different roles are different outcomes.
• Arranging 5 books on a shelf – different sequences are distinct.
• Creating a 4-digit PIN from digits 0–9 – 1234 is not the same as 4321.

The calculator shows both results side by side so you can see how quickly permutations outnumber combinations as r grows.

How to Read the Result

The output is a whole number representing the number of distinct groups possible. For n = 10, r = 3, the result 120 means there are 120 different triplets you can form, and each triplet is counted exactly once. If you list them all, you would never see the same three items listed in a different order as a separate entry.

Notice that C(n, r) always equals C(n, n − r). Choosing 7 items from 10 gives the same 120 result as choosing 3, because every time you pick 3 items you also leave out 7. This symmetry is a quick sanity check.

Common Mistakes and Misconceptions

• Confusing combinations with permutations: The most frequent error. If the problem says “arrange,â€� “order,â€� “sequence,â€� or “rank,â€� it is a permutation. If it says “choose,â€� “select,â€� “group,â€� or “committee,â€� it is a combination.
• Forgetting the division by r!: Many people compute n! / (n−r)! (the permutation formula) and forget to divide by r!. That overcounts by a factor of r!.
• Using n and r interchangeably: C(10, 3) = 120, but C(3, 10) is undefined because you cannot choose 10 items from only 3. The calculator will show an error if r > n.
• Rounding errors with large factorials: For n above 170, factorials exceed the maximum floating-point number in most calculators. This tool handles n up to 170 reliably; beyond that, results may overflow or lose precision.
• Assuming order matters when it does not: For example, counting handshakes among 5 people: each handshake is a pair, and shaking hands with someone is the same whether you initiate or not – that is C(5, 2) = 10, not 20.

Limits of the Formula

The standard combination formula assumes:

• All n items are distinct.
• No item can be chosen more than once (no repetition).
• The selection is unordered.

If repetition is allowed (e.g., choosing 3 scoops of ice cream from 5 flavors, where you can pick the same flavor multiple times), the formula changes to C(n + r − 1, r). For n = 5 and r = 3, that gives C(7, 3) = 35, not the 10 you would get with no repetition. This calculator does not handle repetition – it only computes the classic “choose without replacement� case.

Also, the formula assumes you are selecting exactly r items. If you need “at most r� or “at least r,� you must sum multiple combination terms. For example, choosing any number of toppings from 10 (including none) is 2^10 = 1,024, which is the sum of C(10, 0) through C(10, 10).

Frequently Asked Questions

Does order matter in combinations?

No. In a combination, the order of the selected items is irrelevant. For example, selecting apples and oranges is the same as selecting oranges and apples. If order mattered, you would be counting permutations, not combinations.

What is the difference between nCr and nPr?

nCr counts groups where order does not matter, while nPr counts arrangements where order does matter. For the same n and r, nPr is always larger because each combination of r items can be arranged in r! different ways. The relationship is nPr = nCr × r!.

Can I use this calculator for lottery odds?

Yes, for a simple lottery where you pick r numbers from n without regard to order, the number of possible tickets is C(n, r). The probability of winning with one ticket is 1 / C(n, r). For example, a 6/49 lottery has C(49, 6) = 13,983,816 possible combinations, so your chance is 1 in 13,983,816.

What happens if r is greater than n?

The formula is undefined because you cannot choose more items than exist. The calculator will show an error or an invalid result. Mathematically, C(n, r) = 0 when r > n, but most calculators return an error to alert you to the input mistake.

How do I calculate combinations with repetition?

Use the formula C(n + r − 1, r) instead. For example, choosing 3 scoops from 5 flavors with repetition allowed gives C(7, 3) = 35. This calculator does not include that case, so you would need to adjust the inputs manually.

Why does C(10, 3) equal C(10, 7)?

Because choosing 3 items to include is the same as choosing 7 items to exclude. The symmetry comes from the formula: C(n, r) = C(n, n − r). This is a useful check when you are unsure of your result.

Related

• Aspect Ratio Calculator Pixels: How to Use It
• Exponent Symbol on Calculator: What It Means
• Exponent Calculator with Large Numbers

in n | Total items (n) | items | 10 | 0
in r | Chosen items (r) | items | 3 | 0
out comb | Combinations (nCr) | ways | ncr(n,r) | 0
out perms | Permutations (nPr) | ways | npr(n,r) | 0