Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory intermediate

Problem

Alice is given the numbers , , , , and She must choose a pair of these digits, with the digits being different, to form a two-digit number. How many of the numbers she can construct will be divisible by ?
Solution
For a number to be divisible by , its digits must add up to be a number divisible by . We can easily find that three combinations work: , , and . Since the unit and tens digits are interchangeable (the digits will still add up to a multiple of 3), there are possible numbers.
Final answer
6