Combinations & Permutations Calculator screenshot

Combinations & Permutations Calculator

Exact nCr, nPr and n factorial in integer arithmetic, with no floating-point rounding.

Privacy First
0 Runs
Updated 2026-11-06
No upload
Runs in this tab
No signup

What this page computes

Type n and r, with r not greater than n. The page prints C(n,r) = n!/(r!(n − r)!), P(n,r) = n!/(n − r)! and n! itself, all in exact integer arithmetic, so 100! prints every digit instead of a rounded double. The order of the formulas is stated on the last line. n runs from 0 to 2000 and r from 0 to n.

Combinations ignore order and permutations respect it, which is why C(n,r) is the smaller of the two. The page does not compute multinomial coefficients and does not approximate large factorials with Stirling's formula; a value it cannot print exactly is refused by the bound instead.

All of it is integer arithmetic in this tab, so the same n and r always print the same digits.

The page computes C(n, r) = n!/(r!(n − r)!) and P(n, r) = n!/(n − r)!) exactly, in whole numbers rather than floating point, so a large result is printed in full instead of in exponent form. Ten choose three is 120 and ten permute three is 720, with 10! = 3628800 shown beside them. It counts arrangements of distinct items: n runs from 0 to 2000 and r from 0 to n, and an r larger than n is refused because there is nothing to choose from.

Compute exact combinations and permutations for n up to 2000. The integers are printed in full, with no rounding.

How to use it

Type n, the number of distinct things to choose from, and r, how many you take. Both are whole numbers; n runs from 0 to 2000 and r from 0 to n. Nothing is pasted, because there is no list to read — the page counts arrangements of a set of size n and never asks which items they are.

Why the answers are exact integers

The two counts differ by whether order matters: permutations keep it, combinations divide it out by r!. Both are built from an exact integer factorial, so they are correct to the last digit where a double would have lost the low digits somewhere above 20!. The factorial n! is printed as well, because it is the quantity both formulas are built from and the easiest place to spot an input that is far too large.

What to Expect

Best for

  • Counting arrangements or selections where a rounded answer would be wrong

What this tool keeps

  • Nothing leaves this tab: the arithmetic runs in the page you are reading, and a reload discards both the input and the result.

Sample output

C(10, 3) = 120 P(10, 3) = 720 10! = 3628800 exact integers: C = n!/(r!(n−r)!), P = n!/(n−r)!

Frequently asked questions

What is the difference between the two results?

P(n, r) counts ordered selections, so 1-2 and 2-1 are different; C(n, r) counts unordered selections and divides that count by r!, so they are the same. Ten choose three is 120 and ten permute three is 720.

Why are the numbers not rounded?

They are computed from an exact integer factorial rather than a floating-point one, so the digits printed are the whole answer — including 10! = 3628800 on the same screen.

Is anything uploaded?

No. The two counts are computed in this page from the two whole numbers you typed, and nothing is sent anywhere or stored.

Developer program

Build custom tools for your store

Join the SDK program to create useful ecommerce utilities for your store.