krushal95
can someone explain how to solve this questions using methods such as the ones in OG.
Thanks.
Looking at this probability problem, I'll show you the systematic GMAT approach that's commonly used in the Official Guide.
Understanding the Question:You need the probability that when drawing 3 chips from {1, 2, 3, 4, 5}, the
largest chip drawn is exactly 4 (not 5).
Step 1: Identify the Constraint:For the largest chip to be 4:
- Chip 4 must be selected
- Chip 5 must NOT be selected
- The other 2 chips must come from {1, 2, 3}
Step 2: Count Favorable Outcomes:Since chip 4 is fixed in our selection, we need to choose 2 more chips from the 3 remaining eligible chips {1, 2, 3}:
Favorable outcomes = \(C(3,2) = \frac{3!}{2!(3-2)!} = 3\)
These combinations are: {1,2,4}, {1,3,4}, {2,3,4}
Step 3: Count Total Possible Outcomes:Total ways to select any 3 chips from 5:
Total outcomes = \(C(5,3) = \frac{5!}{3!(5-3)!} = 10\)
Step 4: Calculate Probability:\(P(\text{largest is 4}) = \frac{\text{Favorable outcomes}}{\text{Total outcomes}} = \frac{3}{10}\)
Answer: CKey GMAT Strategy: When a problem asks for "the largest/smallest is X," translate this into:
- X must be included
- All values larger/smaller than X must be excluded
- Choose remaining items from the eligible pool
This constraint-based counting method appears frequently in GMAT probability questions and helps avoid the common error of overcounting or undercounting scenarios.