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 entered10P3{}^{10}P_{3}

10P3=720\displaystyle {}^{10}P_{3} = 720

Combinations (order does not matter)

120\displaystyle 120
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=10n = 10 and r=3r = 3.

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

    10P3=10!(10−3)!=10!7!=10×9×8=720\begin{aligned} {}^{10}P_{3} &= \frac{10!}{(10-3)!} \\ &= \frac{10!}{7!} \\ &= 10 \times 9 \times 8 \\ &= 720 \end{aligned}
  2. Result

    So there are 720720 ways to arrange 33 items chosen from 1010 when order matters.

Worked examples