Skip to main content
OlympiadHQ

Browse · harp

Print

imc

number theory intermediate

Problem

Call a positive integer an uphill integer if every digit is strictly greater than the previous digit. For example, and are all uphill integers, but and are not. How many uphill integers are divisible by ?
(A)
(B)
(C)
(D)
Solution
The divisibility rule of is that the number must be congruent to mod and congruent to mod . Being divisible by means that it must end with a or a . We can rule out the case when the number ends with a immediately because the only integer that is uphill and ends with a is which is not positive. So now we know that the number ends with a . Looking at the answer choices, the answer choices are all pretty small, so we can generate all of the numbers that are uphill and are divisible by . These numbers are , or numbers.
Final answer
C