Let's break down what we're looking for:We need three-digit numbers where:
- All digits are 1-9 (no zeros)
- Exactly two digits are the same
- One digit is different from the other two
Think of examples like 112, 343, 787, or 565—each has exactly two matching digits and one different digit.
Here's the key insight you need to see:In a three-digit number ABC (where A = hundreds, B = tens, C = units), the repeated digit can appear in exactly
three different patterns:
- Pattern 1: A = B ≠ C (like 112, 334, 557)
- Pattern 2: A = C ≠ B (like 121, 343, 575)
- Pattern 3: B = C ≠ A (like 211, 433, 755)
These are the
only ways to arrange exactly two matching digits in a three-digit number.
Now let's count Pattern 1 systematically:For numbers where A = B ≠ C:
- Choose the repeated digit (A = B): You can pick any digit from 1 to 9 → \(9\) choices
- Choose the different digit (C): You can pick any digit from 1 to 9, except it must be different from the repeated digit → \(8\) choices
Total for Pattern 1: \(9 \times 8 = 72\) numbers
Notice that
the same logic applies to Pattern 2 and Pattern 3—each pattern also gives us exactly 72 possible numbers.
Final calculation:Since these three patterns are completely separate (no number appears in more than one pattern), we add them:
\(72 + 72 + 72 = 216\)
Answer: E (216)Want to master the systematic framework for all counting problems like this? You can check out the
complete step-by-step solution on Neuron by e-GMAT to understand the underlying pattern recognition strategy that works across similar combinatorics questions. You can also explore detailed solutions for
other GMAT official questions on Neuron with comprehensive analytics to identify and strengthen your weak areas.
Hope this helps! 🎯