Courses
Courses for Kids
Free study material
Offline Centres
More
Store Icon
Store

Permutation in Mathematics Complete Guide

ffImage
hightlight icon
highlight icon
highlight icon
share icon
copy icon

Permutation formula with solved examples and applications

The concept of permutation is essential in mathematics and helps in solving real-world and exam-level problems efficiently. Understanding permutations makes it easier to tackle questions in competitive exams and daily life where arrangements matter.


Understanding Permutation

A permutation refers to an arrangement of objects in a specific order. In mathematics, permutations are used to count the number of possible ways to arrange a set of items, where the order of selection is important. This concept is widely used in probability, combinatorics, and arranging objects or events.


Permutation Definition

A permutation is an ordered arrangement of objects. The term “permutation” answers the question of how many different orders can be formed from a set of items. For example, arranging the letters A, B, and C as ABC, BAC, or CAB all represent different permutations. The order is always important in permutations.


Permutation vs Combination: Key Differences

Students are often confused between permutation and combination. Here’s a clear table that explains the difference:


Permutation Combination
Order matters in the arrangement Order does not matter in the selection
Example: ABC, BAC are different Example: ABC, BAC are same
Formula: \( nPr = \frac{n!}{(n-r)!} \) Formula: \( nCr = \frac{n!}{r!(n-r)!} \)

Understanding this difference is important for solving exam questions correctly.


Formula Used in Permutation

The standard formula is: \( P(n, r) = \frac{n!}{(n-r)!} \)


Where:

n = total number of objects
r = number of objects selected
n! = n factorial = n × (n-1) × (n-2) × ... × 1

If repetition is allowed, the number of permutations is \( n^r \).


Types of Permutation

Permutations can be classified as:

1. Permutation without repetition (most common in exams).

2. Permutation with repetition (each item can be chosen again).

3. Permutations of multisets (when some objects are identical).

Understanding these types helps solve a variety of questions.


Worked Examples – Solving Permutation Problems

Let’s solve sample permutation questions step-by-step:

1. How many 3-letter words can be formed from “SWING” (without repetition)?
Step 1: Number of objects, n = 5 (letters S, W, I, N, G).

Step 2: Number to be selected, r = 3.

Step 3: Use the formula: \( P(n, r) = \frac{n!}{(n-r)!} \)
\( P(5,3) = \frac{5!}{(5-3)!} = \frac{120}{2} = 60 \)
Final Answer: 60 arrangements.

2. How many 3-letter words can be formed from “SMOKE” (with repetition)?
Step 1: n = 5 (S, M, O, K, E), r = 3.

Step 2: Use the formula for repetition: \( n^r = 5^3 = 125 \)
Final Answer: 125 arrangements.

Practice Problems

  • Find the value of 7P4.
  • List all permutations of the letters 1, 2, 3, 4.
  • If the word “CHAIR” is given, how many ways can 2 letters be arranged?
  • How many permutations are there of the word “MATH” if all letters are used?

Common Mistakes to Avoid

  • Confusing permutation (order matters) with combination (order does not matter).
  • Forgetting to subtract r from n in the denominator in the formula.
  • Not considering repetition options if stated.
  • Missing cases when objects are identical (multisets).

Real-World Applications

The concept of permutation appears in scheduling, seat arrangements, creating passwords, and even in events like sports tournaments. Many probability and statistics questions in exams use the logic of permutations. Vedantu helps students connect these concepts with real-life scenarios and competitive exams.


Key Permutation Links for Further Study


We explored the idea of permutation, how to apply its formulas, solve relevant problems, and why it is important for exams and daily life. Practice more with Vedantu to master these arrangement and counting skills for your board or competitive exams!


FAQs on Permutation in Mathematics Complete Guide

1. What is a permutation in Maths?

A permutation is an arrangement of objects in which the order matters. In permutation problems, changing the position of items creates a different arrangement.

  • For example, the arrangements ABC and BAC are different permutations.
  • Permutations are commonly used in counting arrangements, rankings, and seating problems.
  • They are a key concept in combinatorics and probability.

2. What is the formula for permutation?

The formula for permutation of r objects from n objects is nPr = n! / (n − r)!. Here:

  • n = total number of objects
  • r = number of objects selected
  • n! = factorial of n (n × (n−1) × ... × 1)
This formula calculates the number of ordered arrangements without repetition.

3. How do you calculate permutations step by step?

To calculate permutations, use the formula nPr = n! / (n − r)! and simplify step by step.

  • Step 1: Identify n and r.
  • Step 2: Write the formula nPr = n! / (n − r)!
  • Step 3: Expand factorials and cancel common terms.
Example: Find 5P2.
  • 5P2 = 5! / 3!
  • = (5 × 4 × 3!) / 3!
  • = 5 × 4 = 20

4. What is the difference between permutation and combination?

The main difference is that order matters in permutations but order does not matter in combinations.

  • Permutation formula: nPr = n! / (n − r)!
  • Combination formula: nCr = n! / [r!(n − r)!]
  • Example: Choosing 2 students from A and B — AB and BA are different in permutations but the same in combinations.

5. What is n factorial (n!) in permutations?

The factorial of a number n, written as n!, is the product of all positive integers from n to 1. It is defined as:

  • n! = n × (n−1) × (n−2) × ... × 1
  • By definition, 0! = 1
Example: 4! = 4 × 3 × 2 × 1 = 24. Factorials are essential in permutation and combination formulas.

6. What is permutation without repetition?

A permutation without repetition is an arrangement where each object is used only once. The formula is:

  • nPr = n! / (n − r)!
Example: Arranging 3 letters from A, B, C, D without repetition:
  • 4P3 = 4! / 1! = 4 × 3 × 2 = 24
Each letter appears only once in each arrangement.

7. What is permutation with repetition?

A permutation with repetition allows objects to be selected more than once, and the formula is nr. Here:

  • n = number of available choices
  • r = number of positions
Example: Forming 3-digit codes using digits 0–9:
  • 10 choices for each digit
  • Total permutations = 10³ = 1000

8. How many permutations of n distinct objects are possible?

The number of permutations of n distinct objects taken all at a time is n!. This is because:

  • The first position can be filled in n ways.
  • The second in (n−1) ways.
  • Continuing until 1 way.
Example: Number of ways to arrange 4 books = 4! = 24.

9. What is a circular permutation?

A circular permutation counts arrangements around a circle where rotations are considered the same, and the formula is (n − 1)!.

  • This is because one position is fixed to remove identical rotations.
  • Used in seating arrangement problems.
Example: Arranging 4 people around a round table:
  • (4 − 1)! = 3! = 6

10. What are some real-life applications of permutations?

Permutations are used in real life whenever order and arrangement matter. Common applications include:

  • Seating arrangements at events
  • Password and PIN code creation
  • Ranking in competitions
  • Scheduling tasks in different orders
In all these cases, different orders produce different outcomes, which is why permutation formulas are applied.