Skip to main content
OlympiadHQ

Browse · MathNet

Print

Estonian Mathematical Olympiad

Estonia number theory

Problem

Find the least positive integer such that:

a. both and are divisible by the squares of two distinct prime numbers;

b. both and are divisible by the squares of two distinct prime numbers.
Solution
Both the pair and must contain one odd number. This odd number must be divisible by the square of one of the following numbers: Their squares are , , , , , , .... Thus either or or must be a multiple of one of these squares.

a. We cannot have or , as neither nor is divisible by two prime squares. Similarly, we cannot have or , as and . We also cannot have , as . But works, as . Thus the desired is .

b. In the solution to part (a) we saw that both and are divisible by two prime squares. Therefore, so must also the numbers and . Thus has the desired properties. It remains to show that there are no smaller such numbers. The only option for or not divisible by or is , but we cannot have either or , as and . We may now assume that one of and is divisible by and the other by , as they cannot be divisible by the same prime square.

The odd number out of and is either one of the odd multiples of , which are , , and , one of the odd multiples of , which are and , or one of and . For each of them, only one of the numbers differing from it by is divisible by , so it remains to check that these numbers do not contain any other prime factors squared: $$
Final answer
a: 675; b: 2025

Techniques

Factorization techniquesPrime numbers