There are exactly positive integers such that the base- integer is divisible by (where is in base ten). What is the sum of the digits of ?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Because 2024_b = 2(b³+b+2), the condition is b³+b+2 ≡ 0 (mod 8), which holds exactly when b ≡ 3, 6, 7 (mod 8).
Solution
In base , . So exactly when .
The value of depends only on , so test the eight residues:
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | |
|---|---|---|---|---|---|---|---|---|
| 2 | 4 | 12 | 32 | 70 | 132 | 224 | 352 | |
| mod 8 | 2 | 4 | 4 | 0 | 6 | 4 | 0 | 0 |
So the condition holds exactly when .
Now count such with . Since , each residue class contains numbers in . The class starts at , which is excluded (we need ), leaving ; the classes and start at and , so they contribute each. Hence
and the digit sum is .
The answer is .
Why this works
A base- numeral is a polynomial in , so a divisibility question about it is a congruence in . Pull out common factors first ( reduces the modulus from to ), then a polynomial modulo only depends on , so a table of residues settles everything. The final count is an arithmetic-progression count with attention to the endpoints.
The trap
Forgetting to drop b = 3 (below the required b ≥ 5) from the residue class 3 mod 8, which gives K = 759 and digit sum 21.
Common mistakes
- Forgetting to drop b = 3 (below the required b ≥ 5) from the residue class 3 mod 8, which gives K = 759 and digit sum 21.
- Working mod without factoring out the , which makes the residue table twice as long and error-prone.
Techniques
Organized listing / direct enumeration · Set up the equation/formula and compute; no special trick needed