Permutation Calculator (nPr)

Permutations count ordered arrangements — where the sequence of selection matters.

How the Math Works

The Permutation Calculator (nPr) determines how many ordered arrangements can be formed by selecting r items from a set of n distinct items. This is calculated using the formula nPr = n! ÷ (n - r)!, where n! (n factorial) represents the product of all positive integers up to n. For example, selecting 3 items from 5 gives 5! ÷ 2! = 120 ÷ 2 = 60 possible ordered sequences. The formula accounts for the fact that once an item is chosen, it cannot be reused in the same arrangement, so we divide by the factorial of the remaining unselected items to eliminate redundant orderings.

Practical Applications

Use the nPr calculator when solving problems involving ordered selections without repetition. Common applications include determining how many ways to arrange books on a shelf, select officers for a committee (president, vice president, secretary), or create passwords with specific character requirements. Simply input the total number of items (n) and the number of positions to fill (r), then compute to find all possible unique ordered combinations for probability calculations, scheduling problems, or combinatorial analysis in fields like computer science and operations research.

Day-to-Day Use

Permutation calculations appear in everyday scenarios like creating secure passwords, planning routes between multiple locations, or organizing events with specific sequences. When forming a 4-digit PIN from available digits, selecting 5 songs from your library for a playlist, or determining seating arrangements for dinner guests, understanding permutations helps you grasp the true scope of possibilities. This knowledge aids in making informed decisions about security measures, optimizing schedules, and appreciating the mathematical structure behind seemingly simple ordering tasks in daily life.

Worked example

Top-3 finish from 10 runners → 10P3 = 10 × 9 × 8 = 720 orders.

FAQ