Browse · MathNet
Print58th Ukrainian National Mathematical Olympiad
Ukraine number theory
Problem
Let denote divisors of composite natural number , that is not a square of prime number, . For which are there natural numbers , and , that satisfy the conditions: and ?
Solution
Notice, that from conditions of the task, it follows, that . Using this equality and first equality from conditions, it is possible to rewrite the second equality from the task:
Apart from that, if , then , so ; . Then the number needed has four divisors, or exactly two proper divisors. There are two forms of such numbers: , where are prime numbers, or , where is prime. So, we can consider only case .
Consider two cases.
1. Let be odd number. Then from equality we have, that sum is odd number, then from these divisors there is exactly one even, another is odd. So it is obvious, that , as it is the least even divisor. Then must be prime number. Let , then . So, .
a) If is not prime number, then as , it has prime divisor . Obviously, , and so . But this means, that for number is divisible by , and then number can not be . We get contradiction.
b) If is prime number, then for we get, that it follows from equality , that , then it is proper divisor of number , less than , that is impossible. So, , i.e. numbers and is pair of twin primes. And then we have, that number is solution. Really, , and .
2. Let be even number. As , then is also even, i.e. . Then as , then , as sum of two the least divisors is even. Then . Then , , thus . If , then number 3 is divisor of number , then – contradiction. Thus .
Apart from that, if , then , so ; . Then the number needed has four divisors, or exactly two proper divisors. There are two forms of such numbers: , where are prime numbers, or , where is prime. So, we can consider only case .
Consider two cases.
1. Let be odd number. Then from equality we have, that sum is odd number, then from these divisors there is exactly one even, another is odd. So it is obvious, that , as it is the least even divisor. Then must be prime number. Let , then . So, .
a) If is not prime number, then as , it has prime divisor . Obviously, , and so . But this means, that for number is divisible by , and then number can not be . We get contradiction.
b) If is prime number, then for we get, that it follows from equality , that , then it is proper divisor of number , less than , that is impossible. So, , i.e. numbers and is pair of twin primes. And then we have, that number is solution. Really, , and .
2. Let be even number. As , then is also even, i.e. . Then as , then , as sum of two the least divisors is even. Then . Then , , thus . If , then number 3 is divisor of number , then – contradiction. Thus .
Final answer
Exactly the following n: (i) n has exactly two proper divisors greater than one, i.e., n is either the product of two primes or the cube of a prime (then taking both exponents equal to one works); and (ii) for any pair of twin primes p and p plus two and any integer b at least one, n = 2 · p · (p + 2)^(b − 1) with N = p + 2 and a = 1 (this also includes the case b = 1 giving n = 2p). No other n satisfy the conditions.
Techniques
Prime numbersFactorization techniques