What is Restricted Permutation?
Last Updated :
20 Jan, 2025
Ans: Restricted permutation is the arrangement of elements made under certain restrictions. In restricted permutations, certain elements are always either included or excluded.
Restricted Permutations
The permutation is a way of filtering and selecting a set of objects, where the arrangement of objects does matter. However, the arrangement of objects may be done by imposing certain restrictions in the order of selection. For instance, the order of arrangement of articles, such that an article is always included or excluded from the set of given objects. Imposing the restrictions implies that not all the objects from the given set need to be ordered.
There are different types of common restrictions that may be imposed on the permutation:
- Inclusion of a set of objects
- Exclusion of a set of objects
- Certain objects that always occur together
- Certain objects that stay apart
Common types of restricted permutations are:
- Formation of numbers with digits with some digits at fixed positions.
- Word building with some letters with a fixed position.
- Vowels or consonants in the set of alphabets occur together.
- A set of objects always occurring together
- A set of objects that never occur together
- Restrictions for circular permutations
- Choice of dress to wear from a set of dresses
- Order of eating
- Combinations of the colors to make
Also Read: Permutation and Combinations
- Number of permutations of 'n' things taking 'r' at a time, corresponding to the case where a particular thing always occurs
r × n-1Pr-1
- Number of permutations of 'n' things taking 'r' at a time, corresponding to the case where a particular thing never occurred
n-1Pr
Related Articles:
Sample Questions on Restricted Permutation
Question 1. Find out how many 4 digits numbers without any repetition can be made using 1, 2, 3, 4, 5, 6, 7 if 4 will always be there in the number?
Solution:
Here to find 4 digits number without any repetition can be made using 1, 2, 3, 4, 5, 6, 7 if 4 will always be there in the number,
We will use the formula for
Number of permutations of 'n' things taken 'r' at a time. In which a particular thing always occur = r × n-1Pr-1
Here,
Further putting values in the above formula
⇒ r × n-1Pr-1
⇒ 4 × 7-1P4-1
⇒ 4 × 6P3
⇒ 4 × 6!/3!
⇒ 4 × (6 × 5 × 4 × 3!)/3!
⇒ 480
Therefore, 480 numbers can be made
Question 2. How many 5 digit numbers can be formed by 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. So that 2 is always there in the number?
Solution:
Here to find 5 digit numbers can be formed by 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. So that 2 is always there in the number,
We will use the formula for
Number of permutations of 'n' things taken 'r' at a time. In which a particular thing always occur = r × n-1Pr-1
Here,
Further putting values in the above formula
⇒ r × n-1Pr-1
⇒ 5 × 10-1P5-1
⇒ 5 × 9P
⇒ 5 × 9!/(9-4)!
⇒ 5 × (9 × 8 × 7 × 6 × 5!)/5!
⇒ 15120
Therefore, 15120 numbers can be made
Question 3. How many different three-letter words can be made by 5 vowels if 'a' is never included?
Solution:
Here to find different three-letter words can be made by 5 vowels if 'a' is never included,
We will use the formula for Number of permutations of 'n' things taken 'r' at a time. In which a particular thing never occurred
n-1Pr
Here,
Further putting values in the above formula
⇒ n-1Pr
⇒ 5-1P3
⇒ 4P3
⇒ 4!/(4 - 3)!
⇒ 4 × 3 × 2
⇒ 24
Therefore, 24 words can be made
Question 4. How many four-digit numbers without any repetition can be made by using 1, 2, 3, 4, 5, 6, 7 if 4 will never be included?
Solution:
Here to find four-digit numbers without any repetition can be made by using 1, 2, 3, 4, 5, 6, 7 if 4 will never be included,
We will use the formula for Number of permutations of 'n' things taken 'r' at a time. In which a particular thing never occurred
n-1Pr
Here,
Further putting values in the above formula
⇒ n-1Pr
⇒ 7-1P4
⇒ 6P4
⇒ 6!/(6 - 4)!
⇒ 6 × 5 × 4 × 3 × 2!/2!
⇒ 360
Therefore, 360 numbers can be made
Similar Reads
Restricted Combination Combinatorics is a branch of mathematics that deals with counting, arranging, and combining objects. Combinations are one of the fundamental topics in combinatorics, where we are required to select items from a set and the order of selection does not matter. But there may be additional restrictions
10 min read
Permutation In Mathematics, Permutation is defined as a mathematical concept that determines the number of possible arrangements for a specific set of elements. therefore, it plays a big role in computer science, cryptography, and operations research. For example, take a set {1, 2, 3}:All Permutations taking al
15+ min read
Permutation Matrix Permutation Matrices stand out as a distinct and important element, mentioning the algebraic linear regression and integers in the combination. These matrices are composed of 0s and 1s and are more than just a special mathematical matrix. Knowing the permutation matrices provides the capability to i
13 min read
Permutations: When all the Objects are Distinct Permutations, when all objects are distinct, involve arranging unique items in a specific order without repetition. Each object maintains its individual identity, leading to various arrangements based on their distinct positions. In this article, we will discuss the case of permutation where all the
8 min read
Circular Permutation Circular Permutation is an arrangement notion in which the objects are arranged in a closed loop. The beginning and end points are ambiguous, in contrast to linear layouts. A circular permutation is a configuration of items or components where the starting and ending positions are flexible. It entai
7 min read