GNA University B.Tech Admissions 2025
100% Placement Assistance | Avail Merit Scholarships | Highest CTC 43 LPA
82 Questions around this concept.
What is the no. of ways to divide 10 objects into 2 groups of 5 objects each?
Find the no. of ways in which 11 different things can be arranged into 3 groups.
The number of ways in which 12 balls can be divided between two friends, one receiving 8 and the other 4, is:
JEE Main 2026: Preparation Tips & Study Plan | Previous 10 Year Questions
JEE Main 2026: 100 Days Study Plan | High Scoring Chapters and Topics | Preparation Tips
JEE Main 2025 Most Scoring Concept: January Session | April Session
Don't Miss: Best Public Engineering Colleges
Find the number of ways in which a pack of $52$ playing cards can be divided equally among four persons sitting around a circular table.
The set is to be partitioned into three sets
of equal size. Thus
The number of ways to partition
is
What is the no. of ways to distribute 20 objects equally among 4 persons?
What is the no. of ways to divide 100 persons into 20 equal groups?
100% Placement Assistance | Avail Merit Scholarships | Highest CTC 43 LPA
Ranked #42 among Engineering colleges in India by NIRF | Highest Package 1.3 CR , 100% Placements | Last Date to Apply: 31st August | Admissions Closing Soon
What is the no. of ways to divide 12 objects into 2 distinct groups of 6 objects each?
Let the set $S=\{2,4,8,16, \ldots . .512\}$ be partitioned into 3 sets $A, B, C$ with equal number of elements such that $\mathrm{A} \cup \mathrm{B} \cup \mathrm{C}=\mathrm{S}$ and $\mathrm{A} \cap \mathrm{B}=\mathrm{B} \cap \mathrm{C}=\mathrm{A} \cap \mathrm{C}=\phi$. The maximum number of such possible partitions of $S$ is equal to :
In how many ways can a pack of 52 cards be divided into 4 sets, 3 of them having 16 cards each and the fourth one having just 4 cards.
Consider that 12 people have to be divided among three groups of unequal sizes such as one group has 3 members, one group has 4 members and one group has 5 members.
We could have formed a group of 3 members in ${ }^{12} \mathrm{C}_3$ ways. Having formed a group of three, we would be left with $12-3=9$ people. A group of 4 members can be formed from these 9 members in ${ }^9 \mathrm{C}_4$ ways. For each group of 3 members formed earlier, there would be further ${ }^9 \mathrm{C}_4$ ways of forming a group of four. Thus, the total possible number of ways of forming a group of 3 and a group of 4 would be ${ }^{12} \mathrm{C}_3 \times{ }^9 \mathrm{C}_4$. Now there would be 5 people left who are the third group i.e. the third group can be formed in only 1 way. To maintain consistency, we will say that the third group can be formed in ${ }^5 \mathrm{C}_5$ ways (which is 1 anyway). Thus, the total number of ways of forming the groups is ${ }^{12} \mathrm{C}_3 \times{ }^9 \mathrm{C}_4 \times{ }^5 \mathrm{C}_5$. On expansion, this equals $\frac{(12)!}{3!4!5!}$.
This concept can be generalized for $(m+n+r)$ distinct objects which have to be grouped into three unequal groups containing $m, n$, and $r$ objects. So this grouping can be done in $\frac{(\mathrm{m}+\mathrm{n}+\mathrm{r})!}{\mathrm{m}!\mathrm{n}!\mathrm{r}!}$ number of ways
This same concept will apply for $(m+n)$ distinct object which has to be grouped in two unequal containing $m$, and n items.
Number of ways of dividing mn object into m groups such that all groups contain n objects
equals $\frac{(\mathrm{mn})!}{(\mathrm{n}!)^{\mathrm{m}}} \times \frac{1}{\mathrm{~m}!}$
Example: How many ways 12 people can be divided into 3 groups, such that all three of them contain 4 people each?
Solution: The number of ways of forming the three groups is ${ }^{12} \mathrm{C}_4 \cdot{ }^8 \mathrm{C}_4 \cdot{ }^4 \mathrm{C}_4$. Since we are multiplying these three factors, we are inadvertently also arranging the groups in a particular order. (Remember that if one position can be filled in 5 ways, another can be filled in 4 ways, and the third can be filled in 3 ways when we apply the rule of AND i.e. 5 × 4 × 3, we are basically finding the number of “arrangements” of the three positions)
But the question requires us to just form groups and we do not have to “arrange” the groups. Since we have arranged 3 objects which did not have to be arranged, we have counted each unique way of forming the groups 3! times i.e. 6 times. Thus, the correct answer would be found by dividing the earlier found answer by 3! This will give you the above formula itself.
"Stay in the loop. Receive exam news, study resources, and expert advice!"