Not sure what to do in the future? Don’t worry! We have a FREE career guidance session just for you!
By Karan Singh Bisht
|
Updated on 29 Apr 2025, 11:58 IST
In mathematics, permutation refers to the arrangement of objects in a specific order. Unlike combinations, where the order does not matter, permutations focus on different ways objects can be arranged.
Example: With three letters A, B, and C, the permutations are: ABC, ACB, BAC, BCA, CAB, and CBA.
Permutations are used in probability, computer science, cryptography, seating arrangements, passwords, and scheduling.
Permutation refers to the arrangement of objects in a specific order. When working with permutations, both the selection and the sequence of arrangement are important. In essence, the order in which items are arranged plays a crucial role. Simply put, a permutation is an ordered combination.
The general formula is:
P(n, r) = n! / (n − r)!
Loading PDF...
Example: Arranging 3 books out of 5:
P(5,3) = 5! / 2! = 60
1. Without Repetition
Use standard formula: P(n, r) = n! / (n − r)!
Example: 4-digit PIN using 1-9: P(9,4) = 3024
2. With Repetition
Use: n! / (n1! × n2! × ...) where n1, n2... are repeating item counts.
Example: LEVEL → 5! / (2! × 2!) = 30
| Feature | Permutation | Combination |
| Order Matters | Yes | No |
| Formula | n! / (n - r)! | n! / (r!(n - r)!) |
| Example | Arrange 5 books in 3 slots | Choose 3 books out of 5 |
| Used In | PINs, seatings | Lottery, team selection |
| Also Check |
| Associative Property |
| Centroid of a Triangle |
| Collinear Points |
| Commutative Property |
| Cos 0 |
| Hypotenuse |
Permutation helps solve real-life problems like generating passwords, arranging seats, and scheduling. It's essential in competitive exams, computer science, and probability studies.
A permutation is an arrangement of objects in a specific order. Unlike combinations, the order of elements in permutations matters.
Example: The permutations of the letters A, B, and C include: ABC, ACB, BAC, BCA, CAB, and CBA. Each unique arrangement is counted as a different permutation.
The permutations of the digits 1, 2, 3, 4 are all the possible ways to arrange them in different orders. Since there are 4 digits, the number of permutations is:
4! = 4 × 3 × 2 × 1 = 24
Here are some examples of the 24 permutations:
P(9,3) = 504
The permutation of 5 refers to the total number of ways to arrange 5 unique elements. This is calculated using factorial notation:
5! = 5 × 4 × 3 × 2 × 1 = 120
So, there are 120 permutations of 5 distinct items.
The expression 7 permutation 2 (written as P(7, 2)) means the number of ways to arrange 2 items out of 7 in order.
P(7, 2) = 7! / (7 - 2)! = 7 × 6 = 42
So, there are 42 possible permutations when choosing and arranging 2 out of 7 items.
The three main types of permutations are: