Permutation Calculator

Enter n and r to count the ordered arrangements of r items chosen from n.

Repetition

Whether the same item may be chosen more than once.

A whole number from 0 to 1000.

A whole number from 0 to 1000.

Try

Result

You entered5P5{}^{5}P_{5}

5P5=120\displaystyle {}^{5}P_{5} = 120

Combinations (order does not matter)

1\displaystyle 1
Show the work
  1. Permutations (order matters)

    A permutation is an ordered selection: nn choices for the first place, n−1n - 1 for the second, and so on for rr places. Dividing n!n! by (n−r)!(n-r)! cancels the unused factors. Here n=5n = 5 and r=5r = 5.

    Using nPr=n!(n−r)!{}^{n}P_{r} = \frac{n!}{(n-r)!}

    5P5=5!(5−5)!=5!0!=5×4×3×2×1=120\begin{aligned} {}^{5}P_{5} &= \frac{5!}{(5-5)!} \\ &= \frac{5!}{0!} \\ &= 5 \times 4 \times 3 \times 2 \times 1 \\ &= 120 \end{aligned}
  2. Result

    So there are 120120 ways to arrange 55 items chosen from 55 when order matters.

Worked examples