Step by step
Calculate permutations, nPr — the number of ways to arrange r items chosen from n when order matters — exactly, with the formula and every step shown.
Step by step
A permutation counts ordered arrangements — where the order of the chosen items matters.
Type the total number of items n and how many you are arranging r. Both must be non-negative whole numbers, with r no larger than n.
It computes nPr = n! / (n − r)!, which multiplies out to n × (n−1) × … down to (n−r+1) — r factors in all. The result is exact, even for large numbers, using BigInt arithmetic.
The number of ordered arrangements appears first, with the expanded product below. If order does not matter, use the Combination Calculator instead.