An interesting digit manipulation problem- let us see how to approach this systematically.
Understanding What We Need:You're looking for 3-digit numbers \(abc\) where all digits \(a, b, c\) are nonzero (1 through 9), and when you subtract the reversed number \(cba\) from \(abc\), you get a positive multiple of 7.
Step 1: Let's Express This AlgebraicallyHere's what you need to see - when we write these numbers in place value form:
- \(abc = 100a + 10b + c\)
- \(cba = 100c + 10b + a\)
So the difference becomes:
\(abc - cba = (100a + 10b + c) - (100c + 10b + a)\)
\(= 100a - a + 10b - 10b + c - 100c\)
\(= 99a - 99c\)
\(= 99(a - c)\)
Step 2: Apply the Divisibility ConditionNotice how we need \(99(a - c)\) to be:
- Positive (which means \(a > c\))
- Divisible by 7
Now here's the key insight: Since \(99 = 9 \times 11\) and neither 9 nor 11 shares factors with 7, the expression \((a - c)\) itself must be divisible by 7.
Step 3: Find Valid Digit PairsLet's think about this constraint. Since \(a\) and \(c\) are both digits from 1 to 9:
- The maximum value of \(a - c\) is \(9 - 1 = 8\)
- For \(a - c\) to be positive and divisible by 7, we need \(a - c = 7\)
This gives us exactly two possibilities:
- When \(c = 1\), then \(a = 8\)
- When \(c = 2\), then \(a = 9\)
Step 4: Count All PossibilitiesFor each valid pair \((a,c)\), remember that \(b\) can be any nonzero digit from 1 to 9.
So we have:
- 9 numbers with \((a,c) = (8,1)\)
- 9 numbers with \((a,c) = (9,2)\)
Total: \(9 + 9 = 18\)
Answer: E (18)---
You can check out the
step-by-step solution on Neuron by e-GMAT to explore alternative approaches and discover the systematic framework that applies to all digit manipulation problems. You'll also see how to avoid common traps in similar questions. For comprehensive practice with other GMAT official questions, feel free to visit
Neuron here to build consistent accuracy on these problem types.