Step-by-step explanation:
I assume the digits can be repeated.
so, e.g. 555 is a valid number for this problem, right ?
that means we start with permutations with repetition :
n^r
n = the total number of items to pick from.
r = the number of items being picked per result.
we have 10 digits (0,1,2,3,4,5,6,7,8,9), and we pick 3 of them.
that gives us (with very little surprise, I hope)
10³ = 1000 different possible numbers from 000 to 999.
from these numbers we eliminate all with leading 0.
as we handled all digits the same way and with the same priority, there is the same amount of numbers for every digit in the leading position.
that means 1/10 of the total amount of numbers has a leading 0, or a leading 1, or a leading 2, ...
so, we need to subtract 1/10 × 1000 from 1000 :
1000 - 1000×1/10 = 1000 - 100 = 900
that would be the numbers 100 to 999.
and we have one more condition : the number must be a multiple of 4.
how many are there ?
well, that's the funny thing about numbers : from all numbers 1/2 of them are multiples of 2 (or divisible by 2), 1/3 of them are multiples of 3 (or divisible by 3), and ... you guessed it, 1/4 of them are multiples of 4 (or divisible by 4). and so on.
and so, 1/4 of our 900 numbers are multiples of 4 :
1/4 × 900 = 225
so, there are 225 possible 3-digit numbers that are multiples of 4 and do not start with a 0.
