US

Math

Permutation and Combination Calculator

How many ways there are to choose, with or without order

This permutation and combination calculator tells you how many groups you can make from n items taken r at a time: combinations, permutations and arrangements, with and without repetition.

Result120Combinations C(10, 3): order does not matter, no repetitionPermutations P(10, 3): 720 · Arrangements of all 10 (10!): 3,628,800
With repetition: combinations 220 · permutations 1,000
Formula explained below · reviewed October 17, 2026
Instantthe result updates as you type
Formula shownhow it is calculated, step by step
10/17/2026last reviewed
0 datasent: everything runs in your browser

The key idea

Choosing is not ordering: order multiplies the possibilities

Picking 3 people out of 10 for a committee gives 120 possible groups. If the 3 seats are different (president, secretary and treasurer), there are 720, six times more, because each group can be ordered in 3! = 6 ways. The first question is always whether order matters.

01

How it is calculated

  • Does order matter? Yes → permutations. No → combinations.
  • Do you use all the items? Yes → arrangements of all n, n!. No → permutations P(n, r) or combinations C(n, r).

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

With repetition: (n + r − 1)! / (r! (n − 1)!) combinations   nʳ permutations

02

Worked example

From 10 people you choose 3 for a committee (order does not matter): C(10, 3) = 120. If they are president, secretary and treasurer (order matters): P(10, 3) = 720.

By Javier Mohino · Reviewed on 10/17/2026 · How we review our calculators · Spot an error? Let us know

Typical cases

Combinations chart: n choose r

How many ways you can choose r items out of n when order does not matter and nothing repeats, like 10 choose 3.

nChoose 2Choose 3Choose 4Choose 5
1045120210252
1155165330462
1266220495792
13782867151,287
14913641,0012,002
151054551,3653,003
161205601,8204,368
181538163,0608,568
201901,1404,84515,504
253002,30012,65053,130
304354,06027,405142,506

Worked out with the calculator above: C(n, r) = n! / (r! (n − r)!). If order matters, use permutations above.

Table: Combinations chart: n choose r (n, Choose 2, Choose 3, Choose 4, Choose 5)Save or share this table as an image

Common questions

Frequently asked questions

Back to the calculator
How many combinations are there when you choose 6 numbers out of 56?

32,468,436: you pick 6 numbers out of 56 and order does not matter, which is C(56, 6). It is the kind of count behind a lottery draw where you pick 6 numbers; if the game adds a bonus number, the possibilities grow.

How many 4-digit codes are there?

10,000: order matters and digits can repeat, so they are permutations with repetition, 10⁴. They run from 0000 to 9999.

What is the difference between combinations and permutations?

In permutations order matters and in combinations it does not. AB and BA are two different permutations but a single combination. People also write them as nPr and nCr.

How many ways can you arrange n items?

n! ways (n factorial): with 5 books on a shelf there are 5! = 120 possible orders. It is the permutation of all the items, P(n, n).

What does with repetition mean?

It means the same item can be chosen more than once. With 3 ice cream flavors and 2 scoops, there are 6 combinations if you can repeat a flavor and 3 if you cannot.

Why can n not be larger than 170?

Because 171! is larger than the biggest number the browser can handle, about 1.8 × 10³⁰⁸. Very large results are shown in scientific notation.

Your next calculation

Missing a calculator?

Tell us what you need to calculate. The most requested ones are the first we build, with their formula, a worked example and the source.

Embed this calculator

Paste this code into your website or blog. It is free and updates itself.

Save this calculation

Give it a name so you can find it later. It is stored only in your browser.