Permutation and Combination Calculator

Permutations and Combinations are a subset of the study of finite, discrete structures that is known as Combinatorics. Combinations involve the selection of items without respect to order, whereas permutations are precise selections of elements within a set where the order of the elements is significant. According to mathematical definitions, a common combination lock should actually be called a permutation lock because the order in which the numbers are input matters; for example, 1-2-9 is not the same as 2-9-1, whereas any combination of those three digits would work. The calculator above only takes into account the scenario without replacement, often known as without repetition. There are several kinds of permutations and combinations.

Permutation (nPr) =

?

Combination (nCr) =

?