Basic Permutations – Type 1
$\textbf{Concept Explanation:}$
A permutation is an arrangement of objects in a specific order. The order in which objects are arranged matters in permutations. The number of ways to arrange $n$ distinct objects is $n!$ (n factorial).
$\textbf{Formula:}$
The number of permutations of $n$ distinct objects taken $r$ at a time is given by:
$$
P(n, r) = \frac{n!}{(n – r)!}
$$
Solved Problem – Type 1
$\textbf{Example:}$
Find the number of ways to arrange 4 books on a shelf out of a total of 6 distinct books.
$\textbf{Solution:}$
Here, we need to arrange 4 books out of 6, so we use the permutation formula:
1. Identify $n$ and $r$:
$n = 6$ (total books)
$r = 4$ (books to arrange)
2. Apply the permutation formula:
$$
P(n, r) = \frac{n!}{(n – r)!}
$$
$$
P(6, 4) = \frac{6!}{(6 – 4)!} = \frac{6!}{2!}
$$
3. Calculate the factorial values:
$$
6! = 6 \times 5 \times 4 \times 3 \times 2 \times 1 = 720
$$
$$
2! = 2 \times 1 = 2
$$
4. Calculate the permutation:
$$
P(6, 4) = \frac{720}{2} = 360
$$
Basic Combinations – Type 2
$\textbf{Concept Explanation:}$
A combination is a selection of items where the order does not matter. The number of ways to choose $r$ objects from $n$ distinct objects is given by combinations.
$\textbf{Formula:}$
The number of combinations of $n$ distinct objects taken $r$ at a time is given by:
$$
C(n, r) = \frac{n!}{r!(n – r)!}
$$
Solved Problem – Type 2
$\textbf{Example:}$
How many ways can you choose 3 students from a group of 8 students?
$\textbf{Solution:}$
Here, we are choosing 3 students out of 8, so we use the combination formula:
1. Identify $n$ and $r$:
$n = 8$ (total students)
$r = 3$ (students to choose)
2. Apply the combination formula:
$$
C(n, r) = \frac{n!}{r!(n – r)!}
$$
$$
C(8, 3) = \frac{8!}{3!(8 – 3)!} = \frac{8!}{3! \times 5!}
$$
3. Calculate the factorial values:
$$
8! = 8 \times 7 \times 6 \times 5!
$$
$$
3! = 3 \times 2 \times 1 = 6
$$
4. Simplify the expression:
$$
C(8, 3) = \frac{8 \times 7 \times 6 \times 5!}{3! \times 5!} = \frac{8 \times 7 \times 6}{6}
$$
5. Calculate the combination:
$$
C(8, 3) = \frac{8 \times 7 \times 6}{6} = 56
$$
Permutations with Repetition – Type 3
$\textbf{Concept Explanation:}$
When some objects are identical, the formula for permutations changes because rearranging identical objects does not create a new arrangement.
$\textbf{Formula:}$
The number of permutations of $n$ objects, where there are $p$ objects of one type, $q$ of another type, and so on, is given by:
$$
P(n; p, q, \ldots) = \frac{n!}{p! \times q! \times \ldots}
$$
Solved Problem – Type 3
$\textbf{Example:}$
How many ways can you arrange the letters in the word “BALLOON”?
$\textbf{Solution:}$
Here, we have 7 letters in total, with repetitions: ‘B’ appears once, ‘A’ once, ‘L’ twice, ‘O’ twice, and ‘N’ once.
1. Identify $n$ and the repetitions:
$n = 7$ (total letters)
Repetitions: $p = 1$ (‘B’), $q = 1$ (‘A’), $r = 2$ (‘L’), $s = 2$ (‘O’), $t = 1$ (‘N’)
2. Apply the formula for permutations with repetition:
$$
P(n; p, q, \ldots) = \frac{n!}{p! \times q! \times \ldots}
$$
$$
P(7; 1, 1, 2, 2, 1) = \frac{7!}{1! \times 1! \times 2! \times 2! \times 1!}
$$
3. Calculate the factorial values:
$$
7! = 7 \times 6 \times 5 \times 4 \times 3 \times 2 \times 1 = 5040
$$
$$
1! = 1, \quad 2! = 2
$$
4. Simplify the expression:
$$
P(7; 1, 1, 2, 2, 1) = \frac{5040}{1 \times 1 \times 2 \times 2 \times 1} = \frac{5040}{4} = 1260
$$
$\textbf{Answer:}$
There are 1,260 ways to arrange the letters in the word “BALLOON”.
Combinations with Repetition – Type 4
$\textbf{Concept Explanation:}$
Combinations with repetition allow choosing items where each item can be selected more than once, and the order of selection does not matter.
$\textbf{Formula:}$
The number of combinations of $n$ objects taken $r$ at a time with repetition is given by:
$$
C(n + r – 1, r) = \frac{(n + r – 1)!}{r!(n – 1)!}
$$
Solved Problem – Type 4
$\textbf{Example:}$
How many ways can you distribute 5 identical candies to 3 children?
$\textbf{Solution:}$
Here, the candies are identical, and we are distributing them among 3 children.
1. Identify $n$ and $r$:
$n = 3$ (children)
$r = 5$ (candies)
2. Apply the combination formula with repetition:
$$
C(n + r – 1, r) = \frac{(n + r – 1)!}{r!(n – 1)!}
$$
$$
C(3 + 5 – 1, 5) = \frac{(3 + 5 – 1)!}{5! \times (3 – 1)!} = \frac{7!}{5! \times 2!}
$$
3. Calculate the factorial values:
$$
7! = 7 \times 6 \times 5!
$$
$$
5! = 5 \times 4 \times 3 \times 2 \times 1 = 120
$$
$$
2! = 2 \times 1 = 2
$$
4. Simplify the expression:
$$
C(7, 5) = \frac{7 \times 6 \times 5!}{5! \times 2!} = \frac{7 \times 6}{2}
$$
5. Calculate the combination:
$$
C(7, 5) = \frac{7 \times 6}{2} = 21
$$
$\textbf{Answer:}$
There are 21 ways to distribute the 5 identical candies to the 3 children.
Circular Permutations – Type 5
$\textbf{Concept Explanation:}$ In circular permutations, the objects are arranged in a circle rather than a straight line. The key difference is that in a circle, rotations of the same arrangement are not considered different. For example, arranging three people A, B, and C around a circular table is the same as arranging them in the order C, A, B, due to rotation.
$\textbf{Formula:}$ The number of circular permutations of $n$ distinct objects is:
$$
P_{\text{circular}}(n) = (n – 1)!
$$
Solved Problem – Type 5
$\textbf{Example:}$ In how many ways can 5 people be seated around a circular table?
$\textbf{Solution:}$
1. Identify $n$:
– $n = 5$ (people)
2. Apply the circular permutation formula:
$$
P_{\text{circular}}(n) = (n – 1)!
$$
$$
P_{\text{circular}}(5) = (5 – 1)! = 4!
$$
3. Calculate the factorial:
$$
4! = 4 \times 3 \times 2 \times 1 = 24
$$
$\textbf{Answer:}$ There are 24 ways to seat 5 people around a circular table.
Permutations with Restrictions – Type 6
$\textbf{Concept Explanation:}$ Sometimes, permutations are subject to specific conditions or restrictions, such as certain objects needing to be adjacent or separated by a certain distance.
$\textbf{Example:}$ In how many ways can 5 people be seated in a row if two specific people, A and B, must sit next to each other?
$\textbf{Solution:}$
1. Treat A and B as a single unit. This reduces the problem to arranging 4 units (A-B, and the other 3 people).
2. Identify $n$ for the units:
$n = 4$ (A-B as one unit and three other people)
3. Arrange the 4 units:
$$
P(4) = 4! = 24
$$
4. Within the A-B unit, A and B can switch places. There are 2 arrangements for A and B:
$$
P(A, B) = 2! = 2
$$
5. Total number of arrangements:
$$
\text{Total} = 4! \times 2 = 24 \times 2 = 48
$$
$\textbf{Answer:}$ There are 48 ways to seat 5 people in a row if A and B must sit next to each other.
Combinations with Restrictions – Type 7
$\textbf{Concept Explanation:}$ In some combination problems, specific restrictions may apply, such as certain items being required to be selected together or not selected at all.
Solved Problem – Type 7
$\textbf{Example:}$ How many ways can a committee of 3 people be formed from 8 people if two specific people, X and Y, cannot be on the committee together?
$\textbf{Solution:}$
1. Calculate the total number of combinations without restrictions:
$$
C(n, r) = \frac{n!}{r!(n – r)!}
$$
$$
C(8, 3) = \frac{8!}{3! \times (8 – 3)!} = \frac{8!}{3! \times 5!} = 56
$$
2. Calculate the number of combinations where X and Y are both on the committee:
If X and Y are both chosen, only 1 person needs to be selected from the remaining 6 people:
$$
C(6, 1) = \frac{6!}{1! \times 5!} = 6
$$
3. Subtract the restricted cases from the total:
$$
\text{Valid combinations} = 56 – 6 = 50
$$
$\textbf{Answer:}$ There are 50 ways to form a committee of 3 people from 8 such that X and Y are not on the committee together.
Multi-step Permutations and Combinations – Type 8
$\textbf{Concept Explanation:}$ Some Problems involve multiple steps that require using both permutations and combinations or applying different counting principles in a sequence.
Solved Problem – Type 8
$\textbf{Example:}$ A team of 5 players is to be chosen from 8 players. Out of the 5 selected, a captain and vice-captain need to be appointed. How many ways can this be done?
$\textbf{Solution:}$
$\textbf{1. Step 1:}$ Choose 5 players out of 8:
$$
C(n, r) = \frac{n!}{r!(n – r)!}
$$
$$
C(8, 5) = \frac{8!}{5! \times 3!} = 56
$$
$\textbf{2. Step 2:}$ Appoint a captain and a vice-captain from the selected 5 players:
– Choose the captain (5 choices), then the vice-captain from the remaining 4:
$$
P(5, 2) = 5 \times 4 = 20
$$
$\textbf{3. Total number of ways:}$
$$
\text{Total} = C(8, 5) \times P(5, 2) = 56 \times 20 = 1120
$$
$\textbf{Answer:}$ There are 1,120 ways to select 5 players from 8 and appoint a captain and vice-captain from them.
Distribution of Identical Objects – Type 9
$\textbf{Concept Explanation:}$ This type involves disturbing identical objects into distinct groups. The focus is on how the identical objects can be partitional across different groups.
Problems Involving Multiple Constraints and Divisibility – Type 10
$\textbf{Concept Explanation:}$ This type of problem involves determining how many different ways a sum can be achieved using a combination of different denominators while adhering to a total count of items.
Solved Problem – Type 10
$\textbf{Example Problem:}$ A bill for Rs. 1,840 is paid using denominations of Rs. 50, Rs. 20, and Rs. 10 notes. A total of 50 notes are used.
$\textbf{Statements:} $
1. 25 notes of Rs. 50 are used, and the remaining are in denominations of Rs. 20 and Rs. 10.
2. 35 notes of Rs. 20 are used, and the remaining are in denominations of Rs. 50 and Rs. 10.
3. 20 notes of Rs. 10 are used, and the remaining are in denominations of Rs. 50 and Rs. 20.
Which statements are incorrect?
$\textbf{Solution:}$
$\textbf{1. Analyze Statement 1:}$
25 notes of Rs. 50 means Rs. 1250.
Remaining notes = 50 – 25 = 25 notes.
Remaining amount = Rs. 1840 – Rs. 1250 = Rs. 590.
Let $x$ be the number of Rs. 20 notes and $y$ be the number of Rs. 10 notes:
$$
x + y = 25
$$
$$
20x + 10y = 590
$$
Solving these equations:
$$
x = 22, \quad y = 3
$$
Total notes = $25 + 22 + 3 = 50$. This statement is $\textbf{correct}$.
$\textbf{2. Analyze Statement 2:}$
35 notes of Rs. 20 means Rs. 700.
Remaining notes = 50 – 35 = 15 notes.
Remaining amount = Rs. 1840 – Rs. 700 = Rs. 1140.
Let $x$ be the number of Rs. 50 notes and $y$ be the number of Rs. 10 notes:
$$
x + y = 15
$$
$$
50x + 10y = 1140
$$
Solving these equations:
$$
x = 18, \quad y = -3 \quad (\text{not possible})
$$
This statement is $\textbf{incorrect}.$
$ \textbf{3. Analyze Statement 3:}$
20 notes of Rs. 10 means Rs. 200.
Remaining notes = 50 – 20 = 30 notes.
Remaining amount = Rs. 1840 – Rs. 200 = Rs. 1640.
Let $x$ be the number of Rs. 50 notes and $y$ be the number of Rs. 20 notes:
$$
x + y = 30
$$
$$
50x + 20y = 1640
$$
Solving these equations:
$$
x = 28, \quad y = 2
$$
Total notes = $20 + 28 + 2 = 50$. This statement is $\textbf{correct}.$
Arrangements with specific conditions – Type 11
$\textbf{Concept Explanation:}$ Problems where certain conditions must be met, such as placing specific terms together or ensuring that certain items are never adjacent.
Complex Permutations with Restrictions – Type 12
$\textbf{Concept Explanation:}$
These problems focus on elimination tournaments, where each match results in a loser until one winner remains.
Solved Problem – Type 12
$\textbf{Example Problem:}$
In a chess tournament with 150 entrants, a player is eliminated whenever they lose a match. How many matches are played?
$\textbf{Solution:}$
$\textbf{1. Understanding the Tournament Structure:}$
Each match eliminates one player.
To determine the winner, 149 players must be eliminated.
$\textbf{2. Number of Matches Played:}$
Since each match eliminates one player, 149 matches are required to determine a winner.
$\textbf{Answer:}$ 149 matches are played: $\textbf{(c) 149}$
Counting with Divisibility and Conditions – Type 14
$\textbf{Concept Explanation:}$ Counting problems where the numbers must meet specific divisibility rules or other numeric conditions.
Solved Problem – Type 14
$\textbf{Example Problem:}$
How many 3-digit natural numbers(without repetition of digits) are there such that each digits is odd and the number is divisible by 5?
$\textbf{Solution:}$
$\textbf{1. Identify the Odd Digits and Divisibility by 5 Condition:}$
Odd digits available: 1, 3, 5, 7, 9.
To be divisible by 5, the last digit must be 5.
$\textbf{2. Choosing the first digit:}$
The first digit can be any odd number except 5, because repetition of digits is not allowed, and 5 has already been used as the last digit.
Therefore, the choices for the first digit are: 1, 3, 7, or 9 (4 possible choices).
$\textbf{3. Choosing the second digit:}$
The second digit must also be odd and cannot repeat any digit already used (which includes both the first digit and 5, which is already the last digit).
Therefore, for the second digit, you are left with 3 remaining choices from the set $\{1, 3, 7, 9\}$, excluding the first digit.
$\textbf{4. Calculating the total number of valid numbers:}$
There are 4 choices for the first digit, 3 choices for the second digit, and 1 choice (5) for the last digit.
Therefore, the total number of valid 3-digit numbers is:
$$
4 \times 3 \times 1 = 12
$$
$\textbf{Answer:}$ 12 numbers can be formed: $\textbf{(b) 12}$
Arrangements with set gaps – Type 15
$\textbf{Concept Explanation:}$ These problems involve arranging items while ensuring a specific gap or count between certain items.
Solved Problem – Type 15
$\textbf{Example Problem:}$
How many ways can 2 boys and 2 girls be arranged so that the girls are not next to each other?
$\textbf{Solution:}$
$\textbf{1. Arrange the Boys First:}$
Boys (B) can be arranged in $2! = 2$ ways.
$\textbf{2. Place the Girls:}$
There are three possible gaps (before, between, and after boys).
Choose 2 out of these 3 gaps: $C(3, 2) = 3$.
Girls can be arranged in $2! = 2$ ways.
$\textbf{3. Total Arrangements:}$
Now, to find the total number of arrangements, multiply all the possibilities:
Ways to arrange the boys: 2
Ways to choose the gaps: 3
Ways to arrange the girls: 2
Thus, the total number of arrangements is:
$$
2 \times 3 \times 2 = 12
$$
$\textbf{Answer:}$
12 arrangements are possible: $\textbf{(c) 12}$


