On this page
Many students struggle with permutation and combination problems because they try to memorise isolated formulas instead of understanding the underlying logic. By thinking about the physical process of selection, you can often simplify the math. When facing a classic combinatorics problem—such as selecting a playing 11 from a 15-player squad, and then naming a captain and vice-captain—you have two valid ways to approach the count. You can either pick the entire squad first and then hand out the roles among those chosen, or you can pick the two leaders first from the entire pool and then fill the rest of the squad.
Because both methods count the exact same set of final teams, they must give the exact same total number. In mathematics, this technique is called double counting. It is a reliable way to prove complex formulas without memorising them, as it relies on simple, step-by-step logic instead of algebra.
Picking the squad first?
If you decide to pick the team first, you start with an unordered selection, which uses combinations. The combinations formula, often written as nCr, calculates the number of ways to select r items from a set of n distinct members where the order of selection does not matter.
Applying this formula to select an 11-player squad from 15 players gives exactly 1,365 possible combinations. At this stage, you have an 11-player team standing on the field, but they lack leadership.
To assign the roles, the problem shifts to permutations because the roles are distinct (captain is different from vice-captain). You must choose one player to be the captain, which gives you 11 options. After the captain is named and steps aside, you have 10 players left available for the vice-captain role.
The fundamental counting principle states that you multiply the independent choices together. Multiplying these steps gives 1,365 × 11 × 10 = 150,150 total ways to form the fully led squad.
How is choosing roles first different?
If you reverse the logic, you can start by picking the two leaders directly from the entire 15-player pool. This method often feels more intuitive if you have star players who are guaranteed to lead the team regardless of the rest of the lineup.
First, you choose the captain from the 15 available players, giving 15 options. Next, you choose the vice-captain from the remaining 14 players, giving 14 options. You have now established your leadership duo in 15 × 14 = 210 ways.
At this point, you have two players officially on your team, which means you need 9 more players to complete the playing 11. You must choose these 9 players from the 13 players left unselected in the squad pool. Using the combinations formula again, picking 9 from 13 (13C9) gives exactly 715 ways.
Multiplying these steps gives 210 × 715 = 150,150 ways. As expected, the final number is identical, even though the intermediate numbers (1,365 and 110 versus 210 and 715) look completely different.
Why does this double counting matter for JEE?
This simple squad-picking logic proves a general algebraic rule that frequently appears in competitive exams. Rather than crunching large factorials, examiners want to see if you can spot the hidden symmetry.
If you replace the specific numbers with variables n and r, the first method (choosing the squad then the roles) gives the expression: nCr × r × (r - 1)
The second method (choosing the roles then the rest of the squad) gives the expression: n × (n - 1) × (n-2)C(r-2)
Because both expressions describe the exact same physical outcome—a team of r with two distinct leaders from a pool of n—they are mathematically equal. You can write this identity as: nCr × r(r - 1) = n(n - 1) × (n-2)C(r-2)
When preparing for a time-pressured exam like the JEE, understanding where a formula comes from is much safer and faster than rote memorisation. When you understand the physical meaning behind a formula, you can quickly recreate it in your head even if you forget the exact algebraic expression under pressure. If counting principles and permutations leave you confused, the Fermi Concept Library covers every concept in physics, chemistry, biology, mathematics and computing, letting you explore the underlying logic before you even look at the algebra. And if you ever get stuck simplifying the factorials to prove these identities by hand, the Fermi Problem Library acts as a step-by-step solver that explains the reasoning.
