Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

counting and probability intermediate

Problem

The three-digit number "'' is divisible by 3. How many different three-digit numbers can "'' represent?
Solution
If the number is divisible by , the sum of the digits must be divisible by . So must be one more than a multiple of , since is one less than a multiple of . We have several options:

If , it must be , one possibility.

For , can be to , for four possibilities.

For , can be to , so seven possibilities.

For , anything from to works, so nine possibilities.

For , the pairs range from to , for six possibilities.

If , we can have , , or , so three possibilities.

and up is not possible.

So the total number is

Final answer
30