Permutation Calculator

About Permutation Calculator

Welcome to the Permutation Calculator, a comprehensive tool for calculating permutations P(n,r) with step-by-step solutions, visual examples, and educational explanations. Whether you are studying combinatorics, solving probability problems, or working on real-world arrangement problems, this calculator provides instant results with detailed formula breakdowns.

What is a Permutation?

A permutation is an arrangement of objects in a specific order. Unlike combinations (where order does not matter), permutations consider the sequence or order of items as important. The number of permutations tells us how many different ways we can arrange r items selected from a set of n distinct items.

For example, if you have 3 books (A, B, C) and want to arrange 2 of them on a shelf, the permutations are: AB, BA, AC, CA, BC, CB. That is 6 different arrangements, because AB and BA are considered different (order matters).

Permutation Formula

Where:

• n = total number of distinct items available
• r = number of items to select and arrange
• n! = n factorial = n × (n-1) × (n-2) × ... × 2 × 1

Simplified Permutation Formula

The formula can also be written as a product of r consecutive integers:

Permutation vs Combination

The key difference between permutations and combinations is whether order matters:

How to Use This Calculator

1. Enter n (total items): Input the total number of distinct items you have available.
2. Enter r (items to arrange): Input how many items you want to select and arrange. This must be less than or equal to n.
3. Click Calculate: Press the button to compute P(n,r) with step-by-step solutions.
4. Review results: See the total permutations, comparison with combinations, visual examples, and detailed calculation steps.

Real-World Permutation Examples

Ranking and Competitions

In a race with 10 runners, how many ways can 1st, 2nd, and 3rd place be awarded?

P(10, 3) = 10 × 9 × 8 = 720 different podium arrangements

Password Creation

How many 4-letter passwords can be made from 26 letters (no repeats)?

P(26, 4) = 26 × 25 × 24 × 23 = 358,800 unique passwords

Seating Arrangements

How many ways can 5 people sit in 5 chairs?

P(5, 5) = 5! = 120 different seating arrangements

Task Scheduling

If you have 8 tasks and need to schedule 4 of them in sequence, how many schedules are possible?

P(8, 4) = 8 × 7 × 6 × 5 = 1,680 different schedules

Special Cases of Permutations

P(n, n) = n!

When r equals n, you are arranging all items. P(n, n) = n!/(n-n)! = n!/0! = n!/1 = n!

P(n, 0) = 1

There is exactly one way to arrange zero items: do nothing.

P(n, 1) = n

Selecting and arranging 1 item from n gives n possibilities.

Common Permutation Values

Permutations with Repetition

This calculator handles permutations without repetition (each item can only be used once). For permutations with repetition (where items can be reused), the formula is simply n^r.

Frequently Asked Questions

What is a permutation?

A permutation is an arrangement of objects in a specific order. Unlike combinations, permutations consider the order of items important. For example, arranging 3 books on a shelf where order matters is a permutation problem. The formula is P(n,r) = n!/(n-r)!, where n is total items and r is items to arrange.

What is the difference between permutation and combination?

The key difference is that permutations consider order while combinations do not. P(n,r) = n!/(n-r)! counts ordered arrangements, while C(n,r) = n!/[r!(n-r)!] counts unordered selections. For example, selecting a president, VP, and secretary from 10 people is a permutation (order matters), while selecting 3 committee members is a combination (order does not matter).

How do you calculate P(n,r)?

To calculate P(n,r): 1) Identify n (total items) and r (items to arrange). 2) Use the formula P(n,r) = n!/(n-r)!. 3) This simplifies to n × (n-1) × (n-2) × ... × (n-r+1), which is the product of r consecutive numbers starting from n. For example, P(5,3) = 5 × 4 × 3 = 60.

What does P(n,n) equal?

P(n,n) = n!, which is the number of ways to arrange all n items. When r equals n, the formula P(n,r) = n!/(n-r)! becomes n!/0! = n!/1 = n!. For example, P(4,4) = 4! = 24, meaning there are 24 ways to arrange 4 distinct items.

What are real-world examples of permutations?

Common permutation examples include: arranging books on a shelf, determining race finish orders, creating passwords or PIN codes, scheduling tasks in a specific order, seating arrangements at a dinner table, ranking contestants in a competition, and phone number combinations. Any scenario where the order or arrangement of items matters uses permutations.

Why does the permutation formula use factorials?

Factorials appear in permutation formulas because they count all possible arrangements. For n items: position 1 has n choices, position 2 has (n-1) choices, and so on. The product n × (n-1) × (n-2) × ... × 1 = n!. When selecting only r positions, we divide by (n-r)! to remove the arrangements of positions we are not using.

Additional Resources

• Permutation - Wikipedia
• Combinatorics - Wikipedia

Related MiniWebtools:

Combinatorics: