IMC 2006, Day 1, Problem 2
Find the number of positive integers satisfying the following two conditions:
- ;
- is divisible by .
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution 1. Let and . Let be the decimal writing of an integer . Then obviously . Now, let be fixed. Considering as a variable digit, we have . Since for an iteger , it follows that is divisible by if and only if . Since is obviously impossible, the congruence has exactly one solution. Hence we obtain a one-to-one correspondence between the sets and for every . Therefore , because .
Solution 2. Since and the numbers and are relatively prime, one of them must be divisible by and one of them (may be the same) must be divisible by . Therefore, must satisfy the following two conditions:
Therefore there exist 3 solutions.
Transcribed from the official solutions, page 1. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.