Permutation Calculator - Calculate nPr Online

Calculate permutations (nPr) instantly with our free online permutation calculator. Find the number of ways r items can be arranged from n items with formula and solution shown.

n (total items)

r (items to arrange)

Examples:

Understanding Permutations

Permutations count the number of ways you can arrange items when order matters. Think about it: picking a president, vice-president, and treasurer from 10 people gives different results depending on who gets which role. That's a permutation problem.

The key insight is that each position you fill reduces your options. For the first position, you have n choices. For the second, you have n-1 choices (one person is already placed). For the third, n-2 choices, and so on.

The Permutation Formula

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

Where n is the total number of items, r is how many you're arranging, and ! means factorial (multiply all whole numbers from 1 up to that number). The formula essentially multiplies n × (n-1) × (n-2) × ... for r terms.

When Order Matters

Use permutations when:

• Assigning specific roles (president, VP, secretary)
• Creating passwords or codes
• Arranging items in a row
• Determining race finish orders

When Order Doesn't Matter

Use combinations instead for:

• Selecting team members (no roles)
• Picking lottery numbers
• Choosing menu items
• Drawing cards from a deck

Worked Examples

Example 1: Arranging Books on a Shelf

You have 5 different books and want to display 3 of them on a shelf. How many different arrangements are possible?

n = 5 (total books), r = 3 (books to arrange)

P(5,3) = 5! / (5-3)! = 5! / 2!

5! = 5 × 4 × 3 × 2 × 1 = 120

2! = 2 × 1 = 2

P(5,3) = 120 / 2 = 60

There are 60 different ways to arrange 3 books from 5

Example 2: Race Podium Finishes

In a race with 8 runners, how many different ways can the top 3 positions (gold, silver, bronze) be filled?

n = 8 (runners), r = 3 (podium positions)

P(8,3) = 8! / (8-3)! = 8! / 5!

This simplifies to: 8 × 7 × 6 = 336

There are 336 possible podium outcomes

Example 3: Creating 4-Digit PINs

How many unique 4-digit PINs can be created using digits 0-9 without repeating any digit?

n = 10 (digits 0-9), r = 4 (PIN length)

P(10,4) = 10! / (10-4)! = 10! / 6!

= 10 × 9 × 8 × 7 = 5,040

5,040 unique PINs without digit repetition

Example 4: Electing Club Officers

A club with 12 members needs to elect a president and vice-president. How many possible outcomes?

n = 12 (members), r = 2 (officer positions)

P(12,2) = 12! / (12-2)! = 12! / 10!

= 12 × 11 = 132

132 different ways to elect the two officers

Example 5: Seating Arrangements

Seven people are to be seated in a row, but there are only 4 chairs. How many seating arrangements?

n = 7 (people), r = 4 (chairs)

P(7,4) = 7! / (7-4)! = 7! / 3!

= 7 × 6 × 5 × 4 = 840

840 different seating arrangements

Quick Fact

The factorial symbol (!) was introduced by French mathematician Christian Kramp in 1808. Before that, mathematicians wrote out "factorial" in full. The notation caught on quickly because it saved space - imagine writing n × (n-1) × (n-2) × ... × 1 every time! Fun fact: 0! equals 1 by definition, which makes permutation formulas work correctly even when r equals n.

Frequently Asked Questions

What's the difference between permutations and combinations?

Order matters in permutations but not in combinations. Picking Alice, Bob, then Carol as president, VP, secretary (permutation) is different from Carol, Alice, Bob. But picking those three people for a committee (combination) is the same group either way. Permutations always give larger numbers: P(n,r) = C(n,r) × r!

Can r be larger than n in permutations?

No, that's impossible. You can't arrange more items than you have. If you have 5 books, you can't create an arrangement of 6 books. Mathematically, P(n,r) = 0 when r > n, though most calculators will just give an error.

What does P(n,n) equal?

P(n,n) = n! - you're arranging all n items. For example, P(5,5) = 5! = 120. This makes sense: arranging all 5 books on a shelf means 5 choices for first position, 4 for second, 3 for third, 2 for fourth, 1 for fifth: 5 × 4 × 3 × 2 × 1 = 120.

What does P(n,0) equal?

P(n,0) = 1 for any n. There's exactly one way to arrange zero items: do nothing. Mathematically, P(n,0) = n! / n! = 1. This might seem odd, but it keeps the formulas consistent.

How do I calculate permutations without a calculator?

Don't compute full factorials! Use the shortcut: P(n,r) = n × (n-1) × (n-2) × ... for r terms. For P(10,4), just multiply 10 × 9 × 8 × 7 = 5,040. Much faster than calculating 10! and 6! separately.

When would I use permutations in real life?

Permutations show up in password security (how many possible passwords?), scheduling (how many ways to order tasks?), sports brackets (possible tournament outcomes), genetics (gene sequence arrangements), and any situation where you need to count ordered arrangements.

Other Free Tools

Search tools