How many three-digit positive integers satisfy the following properties?
- The number is divisible by .
- The number formed by reversing the digits of is divisible by .
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
The reversed number ends in N's hundreds digit, which must be 5; then just count multiples of 7 from 500 to 599.
Solution
Reversing the digits of makes its hundreds digit the new units digit. A number is divisible by exactly when its last digit is or . The hundreds digit of a three-digit number cannot be , so it must be : lies between and .
Now count multiples of in that range. The smallest is and the largest is , so there are
of them.
(If ends in , such as , the reversal is still divisible by , so no cases are lost.)
The answer is .
Why this works
Divisibility by or is a statement about one digit only, so a condition on the reversed number is really a condition on the original's leading digit. Once that digit is pinned down, the problem collapses to counting multiples of in a block of consecutive integers, which is or depending on the endpoints.
The trap
Allowing the hundreds digit to be 0, or miscounting the multiples of 7 in the 500s (504 through 595 is 14, not 13).
Common mistakes
- Allowing the hundreds digit to be 0, or miscounting the multiples of 7 in the 500s (504 through 595 is 14, not 13).
- Testing divisibility of the reversal by as well, or requiring itself to end in or .
Techniques
Set up the equation/formula and compute; no special trick needed