Skip to main content
OlympiadHQ

Browse · MathNet

Print

Belarusian Mathematical Olympiad

Belarus number theory

Problem

For all pairs of positive integers that have the same number of divisors we define the operation . Write all their divisors in an ascending order: , and set Find all pairs of numbers , , such that .
Solution
From the definition of it is clear that , so . Note that the minimal number that has at least 7 divisors is 24, hence it is sufficient to consider only from 1 to 6.

Exactly two divisors have only prime numbers, so for the numbers and are prime. From it follows that . But doesn't equal to the product of two prime numbers.

Exactly three divisors have only squares of prime numbers. Let , , then and , hence , which doesn't suit.

Consider the case . Since are all divisors of , then , similarly, . Factor the number : Since , then and . Numbers and are prime, therefore one of them is equal to 2, the other is equal to 3, and each of the numbers and is either prime or a square of and respectively . It is easy to check that for none of the options fits.

Exactly five divisors have only the fourth powers of prime numbers. Up to 23 there is exactly one such number . Note that For larger values of there certainly is no solutions.

Exactly six divisors have only numbers and , where and are prime. Up to 23 there are only three such numbers: 12, 18 and 20, consider them one by one.

Let . Among the divisors of 12 there are exactly two odd: and . The number 497 is odd too, hence and . Therefore, has the form or , where is prime and greater than 3. is impossible since . In the case we get the equation , which has no integer solutions.

Let . From , follows the inequality . Considering the two options and , we obtain the only solution (20, 18).

Suppose . Form follows the inequality . But , hence there is no solutions.
Final answer
(20, 18)

Techniques

τ (number of divisors)Factorization techniquesSums and products