The Art of Distribution
Solving the Partition Puzzle
Welcome, future engineer! Today, we are diving into a classic problem that separates the casual student from the master of combinatorics. We have 5 distinct balls and 3 distinct boxes.
The constraint is simple yet powerful: no box can remain empty. This is not just a counting problem; it is a test of your ability to organize chaos into structure.
Phase 1
The Philosophy of Partitioning
When you see a problem like this, do not rush to write down formulas. Instead, visualize the process. We have 5 distinct balls to place into 3 boxes.
If we just threw them in, we would have 35 possibilities, but that includes scenarios where boxes are empty. To satisfy our constraint, we must first partition our 5 balls into 3 non-empty groups.
The only ways to write 5 as a sum of 3 positive integers are:
1. 3+1+1=5
2. 2+2+1=5
These are our two distinct scenarios. Let us tackle them one by one.
Phase 2
Case 1 - The (3,1,1) Split
Imagine we decide to put 3 balls in one group and 1 ball in each of the other two groups. We select 3 balls from 5 in (35) ways, then 1 from the remaining 2 in (12) ways, and the last ball in (11) ways.
However, here lies the trap: the two groups of size 1 are identical in size. If we simply multiply (35)×(12)×(11), we overcount because the order of these two groups does not matter. We must divide by 2! to correct this.
The number of ways to form the groups is:
2!(35)×(12)×(11)=210×2×1=10
We have 10 ways to form these groups. Since the boxes are distinct, we must multiply by 3! (which is 6) to distribute these groups into the boxes. Thus, for Case 1, we have 10×6=60 ways.
Phase 3
Case 2 - The (2,2,1) Split
Now, let us look at the second possibility: two groups of size 2 and one group of size 1. We select 2 balls from 5 in (25) ways, then 2 balls from the remaining 3 in (23) ways, and the last ball in (11) ways.
Again, we see two groups of the same size (2). We must divide by 2! to avoid overcounting the identical groups.
2!(25)×(23)×(11)=210×3×1=15
We have 15 ways to form these groups. Just like before, we distribute these 3 groups into 3 distinct boxes in 3! ways. So, for Case 2, we have 15×6=90 ways.
Phase 4
The Final Assembly
We have navigated the two possible worlds. Now, we simply bring them together. The total number of ways to distribute the balls such that no box is empty is the sum of our two cases:
There you have it! By breaking the problem into logical partitions and carefully handling the overcounting of identical group sizes, we have arrived at the solution.
Remember, combinatorics is not about memorizing formulas; it is about telling the story of how the objects are arranged. Keep practicing this level of logical rigor, and you will find that even the most complex JEE problems become a beautiful, solvable puzzle.