Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory senior

Problem

The number is divisible by If and each represent a single digit, what is the sum of all distinct possible values of the product (Count each possible value of only once, even if it results from multiple pairs.)
Solution
For to be divisible by it must be divisible by and by It is easier to check for divisibility by first, since this will allow us to determine a small number of possibilities for

For to be divisible by we must have divisible by Going through the possibilities as in part (a), we can find that is divisible by when (that is, and are divisible by while are not divisible by ).

We must now use each possible value of to find the possible values of that make divisible by

First, What value(s) of make divisible by In this case, we need divisible by Since is between and we see that is between and so must be equal to if it is divisible by Thus,

Next, What value(s) of make divisible by In this case, we need divisible by Since is between and we know that is between and and so must be equal to if it is divisible by Thus,

Last, What value(s) of make divisible by In this case, we need divisible by Since is between and we have between and and so must be equal to if it is divisible by Thus,

Therefore, the possible pairs of values are and and and and This gives two possible distinct values for the product and so the answer is
Final answer
59