CalculatorAid
Utility

Permutation Calculator (nPr)

Calculate the number of ways to arrange r items from a set of n items when the order of arrangement matters.

Permutation Inputs

Enter the total items (n) and items to arrange (r)

Awaiting Inputs

Enter valid values where r ≤ n (and n ≤ 170) to calculate the number of permutations.

A permutation counts the number of ways to arrange a subset of items from a larger set where the order of arrangement matters. It's widely used in probability, statistics, and combinatorics problems — such as figuring out how many different rankings, passwords, or seating arrangements are possible from a given pool.

Frequently Asked Questions

nPr, or 'n permute r', is the number of ways to arrange r items from a set of n items where the order of arrangement matters. It's calculated as n! / (n − r)!.

In a permutation, order matters (arranging 3 people in 1st, 2nd, and 3rd place). In a combination, order doesn't matter (choosing a team of 3 from 10 people). Permutations always give a larger or equal result for the same n and r.

5P2 equals 20. There are 20 different ways to arrange 2 items from a group of 5 when the order of arrangement matters.