Calculates the following:

How many combinations can we have from a sample of r elements from a set of n distinct objects where order does matter and replacements are not allowed?

This calculator has 2 inputs.

How many combinations can we have from a sample of r elements from a set of n distinct objects where order does matter and replacements are not allowed?

This calculator has 2 inputs.

- combination
- a mathematical technique that determines the number of possible arrangements in a collection of items where the order of the selection does not matter
_{n}P_{r}= n!/r!(n - r)! - combinations with replacement
- factorial
- The product of an integer and all the integers below it