Calculate the number of permutations (nPr) quickly and accurately. Free, easy to use, and works directly in your browser.
Where n! represents factorial of n (n × (n-1) × (n-2) × ... × 1)
Total number of distinct items in the set
Number of items to select and arrange
Please enter valid numbers.
Number of ways to arrange r items from n items
• Permutations consider the order of arrangement
• Example: For items A,B,C - ABC, ACB, BAC, BCA, CAB, CBA are all different permutations
• When n = r, it's the same as factorial (n!)
• Valid when 0 ≤ r ≤ n
Essential for students, statisticians, programmers, and anyone who needs to determine the number of possible arrangements or orders for a selection of items.
Calculating permutations (nPr) is fundamental in probability, statistics, and combinatorial mathematics to determine the number of possible ordered arrangements, crucial for solving problems in data science, game theory, and secure password generation.