Calculate permutations P(n,r) = n!/(n-r)! - the number of ways to arrange r items from n items where order matters. Supports both with and without repetition.
You might also find these calculators useful
Calculate combinations C(n,r) with or without repetition
Calculate n! factorial, subfactorial, and double factorial
Calculate probability, permutations, and combinations
Calculate percentages, percentage change, and more
Calculate permutations instantly with our easy-to-use calculator. Find the number of ways to arrange r items from n items where order matters. Perfect for probability, combinatorics, and statistics problems.
A permutation is an arrangement of items where the order matters. P(n,r) represents the number of ways to arrange r items from a set of n items. For example, arranging 3 books from a shelf of 10 books - the order ABC is different from BAC. Without repetition: P(n,r) = n!/(n-r)!. With repetition: P(n,r) = n^r.
Permutation Formula
P(n,r) = n!/(n-r)!Calculate possible password combinations for security analysis.
Find ways to assign podium positions in competitions.
Calculate different seating orders for events.
Determine possible plate number combinations.
In permutations, order matters (ABC ≠ BAC). In combinations, order doesn't matter (ABC = BAC). Use permutations when arranging items in a specific order, like assigning positions or creating passwords.