This is a probability problem with constraints - these can definitely be tricky until you see the underlying pattern. Let me walk you through how to think about this one.
Understanding What We're AskedYou need to find the probability that when selecting 3 people from 8, George is included but Nina is not. Let's break this down step by step.
The Key InsightHere's what you need to see: if George
must be selected, then he's automatically taking up one of the three spots. And if Nina
cannot be selected, she's completely out of consideration.
Think about it this way - you've already filled 1 spot (with George), and you've eliminated Nina from the pool. So really, you're just choosing 2 more people from the remaining 6 people (8 total minus George and Nina).
Let's Count the Favorable OutcomesSince George is already selected and Nina is out, we need to choose 2 people from the 6 remaining people.
Number of ways = \(C(6,2) = \frac{6!}{2! \times 4!} = \frac{6 \times 5}{2 \times 1} = 15\)
Total Possible OutcomesWithout any restrictions, the total number of ways to select 3 people from 8 is:
\(C(8,3) = \frac{8!}{3! \times 5!} = \frac{8 \times 7 \times 6}{3 \times 2 \times 1} = \frac{336}{6} = 56\)
Calculate the ProbabilityProbability = \(\frac{\text{Favorable outcomes}}{\text{Total outcomes}} = \frac{15}{56}\)
The answer is
C: 15/56Notice how the constraint actually simplified our problem - instead of dealing with complex conditional probabilities, we just adjusted our selection space. This makes intuitive sense too: the probability (about 0.27) is less than 1/2, which it should be since we have restrictive conditions.
For the complete framework that applies to all constraint-based selection problems, plus alternative approaches and time-saving techniques, you can check out the
step-by-step solution on Neuron by e-GMAT. You'll discover the systematic method to handle any "must include/must exclude" variation quickly. You can also explore other GMAT official questions with detailed solutions on Neuron for structured practice
here.