The base-ten representation for is , where , , and denote digits that are not given. What is ?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
19! ends in three zeros, so H = 0; then the digit-sum test for 9 and the alternating-sum test for 11 pin down T and M.
Solution
Find . The factors contribute three s to , and there are plenty of s, so and the number ends in three zeros: .
Divisibility by 9. Since , the digit sum is a multiple of :
So , giving or .
Divisibility by 11. Since , the alternating digit sum is a multiple of . Reading the digits from the right, the odd positions hold (sum ) and the even positions hold (sum ). Their difference must be a multiple of , so or .
Combine. With : gives , . With , neither nor yields digits. So , , , and .
. The answer is .
Why this works
A factorial is divisible by every small number, so the classical digit tests for and become equations in the unknown digits. One test alone leaves ambiguity; two independent tests intersect in a single solution. Nail down the easiest digit (trailing zeros) first to shrink the unknowns.
The trap
Applying only the divisibility-by-9 test, which leaves T + M equal to 3 or 12, and guessing between choices (A) and (C).
Common mistakes
- Applying only the divisibility-by-9 test, which leaves T + M equal to 3 or 12, and guessing between choices (A) and (C).
- Miscounting positions in the alternating sum for (the number has digits), which flips the sign of .
Techniques
Split into exhaustive cases and handle each · Set up the equation/formula and compute; no special trick needed