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 entered7P0{}^{7}P_{0}

7P0=1\displaystyle {}^{7}P_{0} = 1

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=7n = 7 and r=0r = 0.

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

    7P0=7!(7−0)!=7!7!=1\begin{aligned} {}^{7}P_{0} &= \frac{7!}{(7-0)!} \\ &= \frac{7!}{7!} \\ &= 1 \end{aligned}
  2. Result

    So there are 11 ways to arrange 00 items chosen from 77 when order matters.

Worked examples