Permutations Calculator

What Is the Permutations Calculator?

The Permutations Calculator determines how many ways you can arrange r items selected from n total items when the order of arrangement matters. Unlike combinations, permutations treat different orderings as distinct outcomes—making them essential for passwords, rankings, schedules, and any scenario where sequence creates meaning.

Consider a 4-digit PIN. The code 1-2-3-4 differs from 4-3-2-1, even though both use the same digits. Permutations count these as separate arrangements. This distinction explains why a 4-digit PIN has 10,000 possible codes (10⁴) when repetition is allowed, or 5,040 when digits can't repeat (P(10, 4)).

The notation P(n, r) or ₙPᵣ represents "permutations of n items taken r at a time." Some texts use A(n, r) for "arrangements." Understanding permutations is crucial for cryptography, scheduling algorithms, and probability calculations involving ordered selections.

Permutations Formulas With Complete Calculations

Standard Permutations Formula (No Repetition):

P(n, r) = n! / (n - r)!

Where: n = total items, r = items arranged, ! = factorial

Permutations With Repetition Allowed:

P(n, r) with repetition = nʳ

When you can reuse items (like digits in a PIN), multiply n by itself r times.

Permutations of All n Items:

P(n, n) = n!

Arranging all n items in order gives n factorial possibilities.

Complete Worked Calculation: Award Ceremony Seating

Problem: Eight nominees are seated in a row. How many different seating arrangements exist?

Step 1: Identify n and determine if all items are arranged

n = 8 nominees, all 8 are seated, so r = 8

Step 2: Apply the formula for arranging all items

P(8, 8) = 8!

Step 3: Calculate the factorial

8! = 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 40,320

Result: 40,320 different seating arrangements

Complete Worked Calculation: Race Podium Finishes

Problem: Twelve runners compete. How many ways can gold, silver, and bronze medals be awarded?

Step 1: Identify n and r

n = 12 runners, r = 3 medal positions (order matters: gold ≠ silver ≠ bronze)

Step 2: Apply the permutations formula

P(12, 3) = 12! / (12 - 3)! = 12! / 9!

Step 3: Simplify by canceling 9!

12! / 9! = 12 × 11 × 10 (the 9! cancels from numerator and denominator)

Step 4: Multiply

12 × 11 × 10 = 1,320

Result: 1,320 different podium outcomes

Complete Worked Calculation: Password Possibilities

Problem: A password uses 5 distinct letters from the alphabet. How many possible passwords exist?

Step 1: Identify parameters

n = 26 letters, r = 5 positions, no repetition allowed

Step 2: Apply formula

P(26, 5) = 26! / 21!

Step 3: Calculate

26 × 25 × 24 × 23 × 22 = 7,893,600

Result: Nearly 8 million possible passwords

If repetition were allowed: 26⁵ = 11,881,376 (about 50% more options)

6 Steps to Calculate Permutations

Step 1 — Confirm Order Matters: Ask: Does changing the sequence create a different outcome? Passwords, rankings, schedules, and arrangements all care about order. Teams, committees, and selections typically don't. This determines whether to use permutations or combinations.

Step 2 — Determine If Repetition Is Allowed: Can you reuse items? A PIN allows repeated digits (1-1-1-1 is valid). A race doesn't allow the same runner to finish first and second. Repetition allowed means use nʳ; no repetition means use n!/(n-r)!.

Step 3 — Identify n (Total Items): Count the complete set you're arranging from. For letters in the alphabet, n = 26. For runners in a race, n equals the number of participants.

Step 4 — Identify r (Positions to Fill): Determine how many items you're arranging. A 4-digit PIN has r = 4. A podium with 3 medals has r = 3. Ensure r ≤ n when repetition isn't allowed.

Step 5 — Apply the Appropriate Formula: No repetition: P(n, r) = n!/(n-r)!. With repetition: P = nʳ. All items arranged: P = n!. Use a calculator for factorials beyond 10! to avoid arithmetic errors.

Step 6 — Interpret the Result: The answer represents distinct ordered arrangements. In probability problems, this becomes your total possible outcomes (denominator) when all arrangements are equally likely.

5 Detailed Examples

Example 1: Executive Leadership Assignments

A board of 15 directors must elect a President, Vice President, Secretary, and Treasurer. How many possible officer slates exist?

n = 15 directors, r = 4 positions (each distinct)

P(15, 4) = 15! / 11! = 15 × 14 × 13 × 12 = 32,760

Each position carries different responsibilities, making order critical. This differs from selecting a 4-person committee (which would be C(15, 4) = 1,365).

Example 2: Flight Schedule Optimization

An airline has 6 aircraft and 6 routes. Each plane must be assigned to exactly one route. How many assignment configurations exist?

n = 6 aircraft, r = 6 routes (all positions filled)

P(6, 6) = 6! = 720

Operations research teams evaluate these configurations to minimize fuel costs or maximize on-time performance.

Example 3: License Plate Combinations

A state issues license plates with 3 letters followed by 3 digits. How many unique plates are possible?

Letters: 26³ = 17,576 (repetition allowed)

Digits: 10³ = 1,000 (repetition allowed)

Total: 17,576 × 1,000 = 17,576,000

This explains why states periodically redesign plates—population growth exhausts available combinations.

Example 4: Tournament Bracket Arrangements

In a round-robin tournament, 8 teams each play every other team once. How many distinct game schedules can be created (considering order of games matters)?

First, count games: C(8, 2) = 28 games total

Arranging 28 games in order: P(28, 28) = 28! ≈ 3.05 × 10²⁹

This astronomical number shows why schedulers use constraints (venue availability, rest days) to narrow options.

Example 5: DNA Sequence Analysis

A DNA codon consists of 3 nucleotides chosen from {A, T, G, C}. How many possible codons exist?

n = 4 nucleotides, r = 3 positions, repetition allowed

P = 4³ = 64 possible codons

These 64 codons encode 20 amino acids plus stop signals, with redundancy built into the genetic code.

4 Common Mistakes to Avoid

Mistake 1 — Using Permutations When Order Doesn't Matter: Selecting a 3-person team from 10 people uses combinations, not permutations. P(10, 3) = 720 counts Alice-Bob-Carol as different from Carol-Bob-Alice, but they're the same team. Use C(10, 3) = 120 instead.

Mistake 2 — Forgetting to Account for Repetition Rules: A 4-digit PIN allows 10⁴ = 10,000 possibilities (repetition allowed). But P(10, 4) = 5,040 assumes no repetition. Using the wrong formula halves your estimate. Always clarify whether items can be reused.

Mistake 3 — Miscounting Available Items: For "arrangements of the word MISSISSIPPI," n isn't 11. Repeated letters reduce distinct permutations: 11! / (1! × 4! × 4! × 2!) = 34,650, not 11! = 39,916,800. Account for identical items.

Mistake 4 — Confusing P(n, r) With C(n, r): Permutations always equal or exceed combinations. If your "permutation" answer is smaller than the combination answer for the same n and r, you've swapped formulas. P(n, r) = C(n, r) × r!.

4 Practical Tips

Tip 1 — Use the Multiplication Principle for Complex Problems: Break arrangements into stages. For "3 letters then 3 digits," calculate separately (26³ × 10³) and multiply. This handles mixed repetition rules more easily than a single formula.

Tip 2 — Cancel Factorials Before Computing: P(20, 3) = 20! / 17! doesn't require computing 20! or 17!. Cancel to get 20 × 19 × 18 = 6,840. This prevents overflow errors and speeds manual calculation.

Tip 3 — Recognize When to Use n!: "Arrange all n items" always equals n!. Books on a shelf, people in a line, tasks in sequence—these are all n! problems. Memorize common factorials: 5!=120, 6!=720, 7!=5,040, 8!=40,320, 9!=362,880, 10!=3,628,800.

Tip 4 — Apply Permutations to Probability: For "what's the probability of guessing a 4-digit PIN," use: P = 1 / 10,000. The denominator comes from permutation calculations. This approach works for lottery odds, password cracking estimates, and security assessments.

4 FAQs

Related Calculators

• Combinations Calculator — Counts selections where order doesn't matter
• Probability Calculator — Uses permutations for probability calculations
• Median Calculator — Statistical measure of central tendency
• Standard Deviation Calculator — Measures data spread