Comprehensive guide and practice questions for CBSE Class 11 Applied Mathematics curriculum (2026-27).
8.3 Permutations: Ordered Arrangements, Constrained Groupings, and Multiset Permutations
In Applied Mathematics, cryptographic key design, and process scheduling, a permutation is an arrangement of items where order strictly matters. Whether sequencing industrial operations on an assembly line or generating secure alphanumeric passwords, permutations quantify ordered configurations.
Fundamental Formulae & Theorems
Definition: The number of permutations of \(n\) distinct objects taken \(r\) at a time without repetition is denoted by \(^n P_r\) or \(P(n, r)\):
\[ ^n P_r = \frac{n!}{(n - r)!} = n(n - 1)(n - 2)\dots(n - r + 1) \quad (0 \le r \le n) \]
Permutations with Repetition Allowed:
The number of arrangements of \(n\) distinct objects taken \(r\) at a time when repetition is permitted:
\[ \text{Arrangements} = n^r \]
Permutations of Objects Not All Distinct (Multisets):
If a collection of \(n\) objects contains \(p_1\) objects of type 1, \(p_2\) of type 2, \dots, \(p_k\) of type \(k\) (where \(p_1 + p_2 + \dots + p_k = n\)):
\[ \text{Distinct Permutations} = \frac{n!}{p_1! \cdot p_2! \cdot \dots \cdot p_k!} \]
Circular Permutations:
The number of ways to arrange \(n\) distinct objects in a closed loop or circle:
\[ \text{Circular Arrangements} = (n - 1)! \]
Necklaces & Garlands (where clockwise and counter-clockwise are identical):
\[ \text{Ways} = \frac{(n - 1)!}{2} \]
Systematic Problem-Solving Strategies
Constraint Type
Standard Method
Algebraic Strategy
Items MUST be together (e.g. All vowels together)
String / Block Method
Tie the constrained objects into a single super-object. Arrange the \((n - k + 1)\) entities in \((n - k + 1)!\) ways, then multiply by internal permutations \(k!\) of the super-object.
Items must NEVER be together (e.g. No two boys together)
Gap Method
Arrange the unconstrained objects first. If there are \(m\) unconstrained objects, they create \((m + 1)\) available gaps (including ends). Choose and arrange the constrained items in these gaps.
Fixed positions (e.g. Word begins with 'P' and ends with 'S')
Slot Anchoring
Fill the fixed positions with 1 choice each, then permute the remaining \((n - 2)\) items in \((n - 2)!\) ways.
Comprehensive Word Permutation Example: The Word "MATHEMATICS"
Problem: Consider the word MATHEMATICS. There are 11 letters in total:
M appears 2 times, A appears 2 times, T appears 2 times
H, E, I, C, S appear 1 time each
Vowels: \(\{\text{A, E, A, I}\}\) (4 vowels: two A's, one E, one I)
Consonants: \(\{\text{M, T, H, M, T, C, S}\}\) (7 consonants: two M's, two T's)
All vowels together (String Method):
Treat the 4 vowels \([\text{A, E, A, I}]\) as a single super-block.
Now we arrange 7 consonants + 1 vowel block = 8 entities:
\[ \text{Ways to arrange 8 entities} = \frac{8!}{2! \cdot 2!} = \frac{40{,}320}{4} = 10{,}080. \]
Internal arrangements within the vowel block (4 vowels with two A's):
\[ \text{Vowel block permutations} = \frac{4!}{2!} = \frac{24}{2} = 12. \]
Total arrangements = \(10{,}080 \times 12 = 120{,}960\).
No two vowels together (Gap Method):
First arrange the 7 consonants (with two M's and two T's):
\[ \text{Ways to arrange consonants} = \frac{7!}{2! \cdot 2!} = \frac{5{,}040}{4} = 1{,}260. \]
7 consonants create \(7 + 1 = 8\) gaps:
\[ \_ \text{ C}_1 \_ \text{ C}_2 \_ \text{ C}_3 \_ \text{ C}_4 \_ \text{ C}_5 \_ \text{ C}_6 \_ \text{ C}_7 \_ \]
We place 4 vowels into these 8 gaps. The number of ways to choose 4 gaps and arrange the vowels (two A's):
\[ \binom{8}{4} \times \frac{4!}{2!} = 70 \times 12 = 840. \]
Total arrangements = \(1{,}260 \times 840 = 1{,}058{,}400\).
Progress Tracker & Self-Assessment Checklist
Track your computational speed and mastery of Permutations and Arrangement Techniques.
Conceptual Milestones
Problem Solving Milestones
Practice Worksheet: Graded Exercises & Case Problems
Work through these graded problems from foundational mechanics to applied multi-stage scenarios.
Problem 1 (Solving for \(n\) and \(r\) in Permutations)
Find \(n\) if \(^n P_4 : {}^{n-1}P_4 = 5 : 3\), where \(n > 4\).
Problem 2 (Circular Seating Arrangement with Constraints)
In how many ways can 5 Indian and 5 Japanese executives sit around a round conference table so that no two Indian executives sit together?
View Step-by-Step Solution
Solution:
Use the Gap Method in a circle:
First seat the 5 Japanese executives around the circle. Since circular arrangements of 5 distinct entities have \((5 - 1)! = 4!\) ways:
\[ 4! = 24 \text{ ways.} \]
The 5 seated Japanese executives create exactly 5 gaps between them in the circle:
Notice that in a circle, \(n\) objects create exactly \(n\) gaps (not \(n+1\)).
Now place the 5 Indian executives into these 5 gaps. Because the positions are now defined relative to the already-seated Japanese executives, this is a standard linear permutation:
\[ 5! = 120 \text{ ways.} \]