1999 CEMC Pascal Problems/Problem 15
Problem
For how many different values of is the
-digit number
divisible by
?
Solution
We can use the fact that a number that is divisible by must be divisible by both
and
, since
.
The divisibility rule for states that that the last two digits must be divisible by
. Since
, which is an integer, we know that the number must be divisible by
, no matter what the value of
is.
The divisibility rule of states that the sum of the digits of the number must be divisible by
.
Summing up the digits of the number, we get
This is divisible by when
, so it is divisible by
when
and
.
is a digit, so it must be an integer between
and
(inclusive)
This gives possible values of
.
~anabel.disher