Permutation and combination calculator
Count ordered and unordered selections of r objects from n distinct objects.
Let’s run the numbers
USDTHE NUMBERS, MADE CLEARInstant calculation
＝
Your answer starts here
Check your inputs and select Calculate.
Selections are without replacement from distinct objects; require 0 ≤ r ≤ n ≤ 1000. Selecting zero objects has one outcome. Full exact integer results are shown.
Common uses
Count ordered and unordered selections of r objects from n distinct objects.
BEHIND THE NUMBERSFormula & assumptions
P(n,r) = n! / (n−r)!; C(n,r) = n! / (r!(n−r)!)
Selections are without replacement from distinct objects; require 0 ≤ r ≤ n ≤ 1000. Selecting zero objects has one outcome. Full exact integer results are shown.