Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

counting and probability senior

Problem

How many different positive integers divisible by 4 can be formed using each of the digits 1, 2, 3, and 4 at most once, and no other digits? For example, 12 counts, but 512 does not.
Solution
The only one-digit integer divisible by that we can construct is .

We can construct two-digit integers divisible by : , , and .

An integer is divisible by if its rightmost two digits are divisible by . Thus we can append either or both of the remaining two digits to any of these two-digit integers and preserve divisibility by . For each, there are ways to choose one digit to append, and ways to order the digits if we append both of them. Thus we get more integers for each, or total.

The full number is integers.
Final answer
16