Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory junior

Problem

Given that is divisible by 12, what is the sum of all of the digits that could replace ?
Solution
In order for a number to be divisible by 12, it must be divisible by 4 and 3. For a number to be divisible by 4, its last two digits must be divisible by 4. In this problem, the number must be divisible by 4. This limits the possibilities of to , , , , and . For a number to be divisible by 3, the sum of its digits must be divisible by 3. Since, , the numbers that satisfy this condition are , , and . The only digit that satisfies both conditions is , so the sum of all of the digits that could replace is .
Final answer
4