Analyzing the Setup
My dear student, welcome to a fascinating exploration of combinatorics. Often, students fear these problems, seeing them as a maze of formulas. But I want you to see them as a story of possibilities.
Imagine you are standing in front of a group of students: 5 boys in one corner and n girls in another. You are tasked with forming a team of 3.
There is a catch—a constraint that forces us to think. We need at least one boy and at least one girl. This isn't just a math problem; it is a logic puzzle.
The Logic of Cases
Since our team size is fixed at 3, how can we satisfy the condition of having at least one of each gender? We cannot have all boys, and we cannot have all girls.
This leaves us with only two mutually exclusive scenarios. Either we pick 1 boy and 2 girls, or we pick 2 boys and 1 girl. These are our two paths.
In the first path, we select 1 boy from 5 and 2 girls from n. Mathematically, this is 5C1⋅nC2.
In the second path, we select 2 boys from 5 and 1 girl from n, which is 5C2⋅nC1. Because these paths are distinct, we add them together to find the total number of ways:
Peeling Back the Algebra
Now, let's bring in the machinery of combinations. We know that 5C1=5 and 5C2=10. For the girls, nC2=2n(n−1) and nC1=n.
Substituting these into our equation, we get:
To make this equation elegant, let's multiply everything by 2 to clear the denominator:
Now, expand the bracket:
Simplifying this, we arrive at 5n2+15n=3500. Dividing the entire equation by 5 gives us the quadratic:
The Final Resolution
We are looking for two numbers that multiply to −700 and add to 3. Through a bit of mental arithmetic, we find 28 and −25.
Thus, the equation factors beautifully into:
This gives us two potential values for n: 25 and −28. As we discussed, we must reject the negative value because we cannot have a negative number of students.
Therefore, n=25. You have successfully navigated the constraints, translated the logic into algebra, and solved for the unknown.