Click to Chat
1800-2000-838
+91-120-4616500
CART 0
Use Coupon: CART20 and get 20% off on all online Study Material
Welcome User
OR
LOGIN
Complete Your Registration (Step 2 of 2 )
Combinations
What do you mean by Combination?
Explain Combination with different examples
How the different groups can be formed using Combination?
How the alike objects can be distributed?
When is ^{n}C_{r }maximum?
Is there any relation between Permutation and Combination?
Differentiate Permutation and Combination
Some Important Results
These two words permutation and combination, at the initial level are very confusing and are generally used interchangeably. So, let’s take them one by one and understand them.
Combination means from the given certain objects (may be alike or different) selecting one or more objects. Combination can also be replaced by the words – selection, collection or committee.
For Example
Combination of top 5 cricket players from the team of 11 players is the selection of 5 players (in any order).
The sequence in which they have to be selected is not important here. Also, we can say that the order of selection is not the concern in the case of combination
Combination is the selection or collection of one or more things from the given list of alike or distinct objects taken all or some at a time.
In general, the combination of n distinct objects taken r at a time, is represented and calculated as:
This can also be represented as:
Here, in the definition of combination, r can be any positive integer less then or equals to n.
Let’s discuss few important cases here in combination.
Theorem - III
The number of combination of n different things taken r at a time.
Example
Calculate the number of selections of 3 different colored pens from the available 5 pens of all different colors.
Here, we just need to select 3 pens (in any order) from the available 5 pens. This can be calculated as:
Here, in this theorem, note that if r = n that is, all the things have to be selected.
So
which is very obvious.
Theorem – IV
Number of combination of n different things taken r at a time when p particular things are always included will be calculated as
^{n-p}C_{r-p}
Calculate the number of ways of combination or selection of 11 players out of 20 players when Virat Kohli, M.S. Dhoni and Y. Singh are always included.
Here we have been giving 20 players of which only 11 players are to be selected. We are also given the 3 players out of 20 which must be included in any case. So, actually we can understand that, out of 11 we have already selected 3 players so we just need to select 8 addition players from the remaining 17 players.
Thus, Total number of ways for the above problem = ^{20-3} C_{11-3 }= ^{17}C_{8}
Theorem - V
The number of combination of n different things taken r at a time when p particular things are always excluded can be calculated as:
^{n-p}C_{r}
Let’s take the same kind of example which we have discussed in previous theorem.
Calculate the number of ways of combination or selection of 11 players out of 20 players when Ravindra Jadeja and Balaji are always excluded.
Again we have been given 20 players of which 11 players to be selected but this time 2 specific players are to be excluded. Thus actually we have the option of 18 players effectively for selecting 11 players.
Thus, The total number of selections = ^{20-2}C_{11} = ^{18}C_{11}
Let’s first understand the meaning of formation of groups. Given the objects and the number of groups to be formed, we need to select the different combination of objects to make the groups.
if we are given four players, P_{1}, P_{2}, P_{3} and P_{4}, and if we are asked to form two groups one containing 3 players and other containing one player. Then we may form the groups as follows:
Group – 1 Group - 2
_{}Thus in general, The number of ways in which (p + q) different things can be divided in two groups, one containing ‘p’ things and other contains ‘q’ things is
Also, since
^{p+q}C_{p } = ^{p+q}C_{q }
In the above formula, ^{p+q}C_{p } can also be understood as selecting p (for group - 1) or rejecting ‘q’ (for group - 2) out of available (p + q) things.
Important Note:
If the size of the two groups are equal that is, p = q, then the total number of ways of formation of two groups of ‘p’ and ‘q’ things will be
Here we divide by 2! just to avoid the false counting.
To understand this false counting. Let’s again take one similar example, where we have four players P_{1}, P_{2}, P_{3} and P_{4} for which two groups of equal size is to be formed.
The possible combinations will be as:
We can clearly see that, half of the combinations are repeated. These repeated combinations are called as the false cases.
Similarly, the total number of ways in which (p+ q+ r) different things can be divided into three unequal groups p, q, and r is
If all the three groups are of equal size that is, (p = q = r), then the required distinct ways
In how many ways 3 teams of 11 players each, 4 teams of 6 players each, 2 teams of 15 players each can be formed out of 87 players.
In how many ways six different books can be distributed between four persons, so that each person gets at least one book.
Here we may have two cases possible – {1, 1, 1, 3} and {1, 1, 2, 2}
Here, we have two special types for the formation of groups or distribution of alike objects.
Type – 1:
The total number of ways in which ‘n’ identical coins can be distributed to ‘p’ persons so that each person may get any number of coins is
In how many ways, 8 identical coins can be distributed among 4 persons P, Q, R and S.
Here, we have 8 coins and 4 persons, so the required ways = ^{8+4-1}C_{4-1 }= ^{11}C_{3.}
Type – 2:
The total number of ways in which ‘n’ identical coins can be distributed to ‘p’ persons so that each person receives at least one item is
^{n-1}C_{p-1}
In how many ways, 8 mangos can be distributed among 4 persons P, Q, R and S such that all of them receives at least one mango.
The required ways = ^{8-1}C_{4-1 = }^{7}C_{3}
If you would have studied binomial theorem, then you can easily related the ^{n}C_{r} as the coefficient of binomial expansion. And these binomial expansions are also related with the pascal’s triangle.
In Pascal’s triangle or the binomial expansion, the value of coefficients increasing initially and reaches its maximum and then starts falling till minimum value at the end.
Thus, ^{n}C_{r }will be maximum depending upon the value of n as r goes from 0 to n.
Thus, If n even, ^{n}C_{r} will be maximum at r = n/2.
While, for n to be odd, ^{n}C_{r }will be maximum at either
So, finally ^{n}C_{r }is maximum at
^{15}C_{r } is maximum when r = 7 or 8 while ^{14}C_{r } is maximum when r = 7
As discussed in the previous sections, permutation is the combination (or selection) and then arrangement as well.
Thus, while calculating the permutation, we first need to choose or selecting the thing before their arrangement.
So,
This can also be understood from their mathematical relation. Since we know that,
Thus, from the above two formulas, this is very clear that
^{n}P_{r} = ^{n}C_{r} r!
where, ^{n}C_{r} denotes the selection and r! denotes the arrangement of r objects for the r places.
The very basic difference in permutation and combination is the order of the objects considered. In combination, the order is not considered at all while for permutation it is must. So, the permutation is the ordered arrangement while the combination is the unordered selection.
From the three alphabets A, B and C, the permutation of these 3 letters will be ABC, ACB, BAC, BCA, CBA and CAB. While the combination of 3 letters will be just (A, B, C).
Permutation gives the answer to the number of arrangements while the combination explains the possible number of selections.
Permutation of a single combination can be multiple but the combination of a single permutation is unique (considering all at a time).
In this section, we shall take few important points with respective to the competitive examination.
Consider ‘p’ points in a plane of which q (< p) are collinear, then
C_{2 }- ^{q}C_{2} + 1
C_{3 }- ^{q}C_{3}
C_{2 }- p
C_{2 }x ^{q}C_{2}
The number of triangles having exactly two sides common to the polygon = p
The number of triangles having exactly one side common to the polygon = p (p-4)
The number of triangles having no sides common to the polygon = p(p-4)(p-5)/6
Watch this Video for more reference
More Readings
To read more, Buy study materials of Permutations and Combinations comprising study notes, revision notes, video lectures, previous year solved questions etc. Also browse for more study materials on Mathematics here.
Signing up with Facebook allows you to connect with friends and classmates already using askIItians. It’s an easier way as well. “Relax, we won’t flood your facebook news feed!”
Post Question
Dear , Preparing for entrance exams? Register yourself for the free demo class from askiitians.
Fundamental Principle of Counting Table of Content...
Restricted Selection and Arrangement (a) The...
Circular Permutations The arrangements we have...
Permutations Table of Content What do you mean by...
Division and Distribution of Objects (With fixed...
Derangement Theorem and Multinomial Theorem Table...
Useful Tips for Algebra Some Useful Tips (i)...
Permutations Vs Combinations Difference between...
Permutaions and Combinations – Solved...