So far our task was always to “arrange” objects i.e. to place them in a specific order among themselves. Sometimes we would be interested in only “selecting” a few objects out of the given objects. In this case, we just need to “select” and we do not need to “arrange” them in an order. The selection of objects is called combinations. In real life, we use combinations for making lottery numbers and selecting nominees for student council.
In this article, we will cover the Introduction to Combinations. This topic falls under the broader category of Permutations and combinations, which is a crucial chapter in Class 11 Mathematics. This is very important not only for board exams but also for competitive exams, which even include the Joint Entrance Examination Main and other entrance exams: SRM Joint Engineering Entrance, BITSAT, WBJEE, and BCECE.
The meaning of combination is selection. Suppose we want to select two objects from four distinct objects a, b, c, and d. This can be stated as a number of combinations of four different objects taken two at a time.
Here we have six different combinations ab, ac, ad, bc, bd, cd. In other words, we can say that there are six ways in which we can select two objects from four distinct objects.
We can generalize this concept for r object to be selected from given $n$ objects as
$
\begin{aligned}
& { }^n C_r \times r!={ }^n P_r \\
& { }^n C_r=\frac{{ }^n P_r}{r!} \\
& { }^n C_r=\frac{n!}{(n-r)!r!}
\end{aligned}
$
Where $0 \leq r \leq n$, and $r$ is a whole number.
Let's derive the value of ${ }^{\mathrm{n}} \mathrm{C}_{\mathrm{r}}$, and its relation with permutation notation.
We can calculate the same thing by another method: by selecting 2 things out of 5 , which can be done as ${ }^5 \mathrm{C}_2$ and then arranging the 2 selected things which can be done in 2 ! ways. So we have
$
\begin{aligned}
& { }^5 \mathrm{C}_2 \times 2!={ }^5 \mathrm{P}_2 \\
& { }^5 \mathrm{C}_2=\frac{{ }^5 \mathrm{P}_2}{2!} \\
& { }^5 \mathrm{C}_2=\frac{5!}{(5-2)!2!}=\frac{5!}{3!2!}
\end{aligned}
$
The combination is a type of permutation where the order of the selection is not considered. Hence, the count of permutations is always more than the number of the combination.
The notation of selecting r objects from n given object is ${ }^{\mathrm{n}} \mathrm{C}_{\mathrm{r}}$.
Corresponding to each combination of ${ }^{\mathrm{n}} \mathrm{C}_{\mathrm{r}}$, we have r ! permutations because r objects in every combination can be rearranged in r! ways.
So, the relation between combinations and permutations is given by
$
{ }^n C_r \times r!={ }^n P_r
$
Example: In ICC World Cup 2019 total of 10 teams participated and each team has to play one game in the league stage with all other teams before qualifying for the semifinals, how many total games will be played in the league stage?
Solution: For playing a game we need to select two teams. So this is a simple problem of selecting two teams, so this can be done in
$
\begin{aligned}
& { }^{10} \mathrm{C}_2=\frac{10!}{(10-2)!2!} \\
& \frac{10 \times 9 \times 8!}{8!\times 2!}=\frac{10 \times 9}{2}=45
\end{aligned}
$
Hence in total 45 games will be played in the league stage.
Combinations provide a systematic way to determine how many ways we can select subsets from a larger set without considering the order of selection. It helps in probability, statistics, and combinatorial mathematics. Mastering the principles of combinations helps us to analyze and solve complex problems.
$
\begin{aligned}
& \quad \text { R } 1 \mathrm{~W} 3 \mathrm{O}+2 \mathrm{R} 1 \mathrm{~W} 2 \mathrm{O}+1 \mathrm{R} 2 \mathrm{~W} 2 \mathrm{O} \\
& { }^7 \mathrm{C}_1 \cdot{ }^5 \mathrm{C}_1 \cdot{ }^8 \mathrm{C}_3+{ }^7 \mathrm{C}_2 \cdot{ }^5 \mathrm{C}_1 \cdot{ }^8 \mathrm{C}_2+{ }^7 \mathrm{C}_1 \cdot{ }^5 \mathrm{C}_2 \cdot{ }^8 \mathrm{C}_2 \\
& =6860
\end{aligned}
$
Hence, the answer is 6860 .
Example 2: Let $S=\{1,2,3,5,7,10,11\}$. The number of non-empty subsets of $S$ that have the sum of all elements as a multiple of 3 , is
[JEE MAINS 2023]
Solution
No. of element $1=\{3\}$
No. of element $2=\{(3 \mathrm{~K}+1),(3 \mathrm{k}+2)\}$
(3) $(3)=9$
No. of element $3=\{3 \mathrm{k}, 3 \mathrm{k}+1,3 \mathrm{~K}+2\} \quad=$ (1) (3) (3) $=9$ $=\{(3 \mathrm{k}+1),(3 \mathrm{k}+1),(3 \mathrm{k}+1)\}=1$
$
=\{(3 \mathrm{~K}+2),(3 \mathrm{k}+2),(3 \mathrm{k}+2)\}=\frac{1}{11}
$
No. of element $4=\{3 \mathrm{k}, 3 \mathrm{k}+1,3 \mathrm{k}+1,3 \mathrm{k}+1\} \rightarrow 1$
$=\{3 \mathrm{k}, 3 \mathrm{k}+2,3 \mathrm{k}+2,3 \mathrm{k}+2\} \rightarrow 1$
$
=(3 \mathrm{k}+1,3 \mathrm{k}+2,3 \mathrm{k}+2,3 \mathrm{k}+1\} \rightarrow{ }^3 \mathrm{C}_2 \times{ }^3 \mathrm{C}_2=9
$
No. of element $5=9$, no. of element $6=1$, no. of element $7=1$
Total $=43$
Hence, the answer is 43 .
Example 3: Let the digits $\mathrm{a}, \mathrm{b}$, and c be in A.P. Nine-digit numbers are to be formed using each of these three digits thrice such that three consecutive digits are in A.P. at least once. How many such numbers can be formed?
[JEE MAINS 2023]
Solution
$a b c$ or cba
$a b c$
$c b a$
$
\frac{{ }^7 C_1 \times 2 \times 6!}{2!2!2!}=1260
$
Hence, the answer is 1260.
Example 4: A bag contains six balls of different colours. Two balls are drawn in succession with replacement. The probability that both the balls are of the same colour is $p$. Next four balls are drawn in succession with replacement and the probability that exactly three balls are of the same colour is q . If $\mathrm{p}: \mathrm{q}=\mathrm{m}: \mathrm{n}$, where m and n are coprime, then $\mathrm{m}+\mathrm{n}$ is equal to $\qquad$
[JEE MAINS 2023]
Solution
$\begin{aligned}
&\begin{aligned}
& p=1 \cdot \frac{1}{6} \\
& \mathrm{q}=\left({ }^6 \mathrm{C}_1 \cdot \frac{1}{6} \cdot \frac{1}{6} \cdot \frac{1}{6} \cdot \frac{5}{6}\right) \frac{4!}{3!}=\frac{5}{216} \times 4=\frac{5}{54} \\
& \frac{p}{q}=\frac{1 / 6}{5 / 54}=\frac{9}{5} \\
& \mathrm{~m}=9 \\
& \mathrm{n}=5 \\
& m+n=9+5=14
\end{aligned}\\
&\text { Hence, the answer is } 14
\end{aligned}$
Example 5: A class contains b boys and $g$ girls. If the number of ways of selecting 3 boys and 2 girls from the class is 168 , then $b+3 g$ is equal to $\qquad$
[JEE MAINS 2022]
Solution
$
\begin{aligned}
& \text { Number of ways }={ }^{\mathrm{b}} \mathrm{C}_3 \cdot{ }^{\mathrm{g}} \mathrm{C}_2=168 \\
& \Rightarrow \frac{\mathrm{b}(\mathrm{b}-1)(\mathrm{b}-2)}{6} \cdot \frac{\mathrm{g}(\mathrm{g}-1)}{2}=168 \\
& \Rightarrow \mathrm{b}(\mathrm{b}-1)(\mathrm{b}-2) \mathrm{g}(\mathrm{g}-1)=8 \cdot 7 \cdot 6 \cdot 3 \cdot 2 \\
& \Rightarrow \mathrm{b}=8, \mathrm{~g}=3 \\
& \Rightarrow \mathrm{b}+3 \mathrm{~g}=8+9=17
\end{aligned}
$
Hence, the answer is 17.