How it works
Combinations count selections without order: n! ÷ (r!(n − r)!). Permutations count ordered selections: n! ÷ (n − r)!.
Items must be distinct and selections are without replacement. Repeated objects and replacement draws need different formulas. Integer results are exact.
Worked example
Choosing 3 items from 10 gives 120 combinations when order does not matter and 720 permutations when it does.
Cite this page
ToolOctopus. “Permutation and combination calculator.” Updated . https://tooloctopus.com/permutation-combination-calculator.
Add an access date if your instructions require one.
Citation formatting uses citeproc-js by Frank Bennett and Citation Style Language styles. License and source code.