This permutation calculator is a tool that will help you determine the number of permutations in a set (often denoted as nPr). Read on to learn:
- the permutation definition
- permutation formula
- the relation between permutation and combination.
Permutation is the number of ways in which you can choose r elements out of a set containing n distinct objects, whre the order of the elements is important.
For example, imagine that you have a deck of nine cards with digits from 1 to 9. You draw three random cards and line them up on the table, creating a three-digit number. How many distinct numbers can you create?
Luckily, you don't have to write down all of the possible numbers. You can use a formula that will allow you to calculate the number of permutations in no time:
P(n,r) = n!/(n-r)!
pis the number of permutations,
nis the total number of elements in the set,
ris the number of elements you choose from this set.
The exclamation mark represents a factorial. Check out our factorial calculator for more information on this topic.
You may also notice that, according to the permutation formula, the number of permutations for choosing one element is simply
n. On the other hand, if you have to choose all elements, the formula gets reduced to
Let's apply this equation to our problem with numbered cards. We need to find the number of ways to choose 3 out of 9 cards:
P(9,3) = 9!/(9-3!) = 9!/6! = 504
You can check the result with our nPr calculator.
Permutation and combination
If you switch on the advanced mode, you will be able to find the number of combinations as well. Combinations are also ways to choose
r out of
n elements. Unlike in permutations, the order of the combinations doesn't matter.
For example, imagine a bag filled with twelve balls, each one of a different color. You pick five balls at random. How many distinct sets of balls can you get?
If you know the number of permutations, you can easily calculate the number of combinations, too:
C(n,r) = P(n,r)/P(r,r) = P(n,r)/r!