Skip to main content
OlympiadHQ

Browse · MathNet

Print

China Southeastern Mathematical Olympiad

China number theory

Problem

Let and be positive integers such that . If there exists a positive integer such that , then we say that the pair is good. Determine the number of good pairs.
Solution
Let , , , , , then . So and . Since , we have . Therefore, any prime factor of can be divided by . If there is a prime factor of or no less than , then divides . So divides or divides , but , which is a contradiction. So the prime factor of may be , , or . If there are at least three prime factors of among , , , , then there is a prime factor of or no less than . And , so that or , which is a contradiction. The prime factor set of cannot be , otherwise, or , which is a contradiction. Similarly, the prime factor set of cannot be . Therefore, the prime factor set of can only be , , , , , , or .

i) If the prime factor set of is , then can only be . Then, , . So there is one good pair .

ii) If the prime factor set of is , then can only be . Then , or , . So there are two good pairs and .

iii) If the prime factor of is , then can only be or . For , then , ; , ; , ; , . For , then , ; , . There are six good pairs.

iv) If the prime factor of is , then can only be , , , or . For , , ; , ; , ; , ; , ; , ; , ; , ; , ; , . For , , ; , ; , ; , . For , , ; , . For , , ; , . , , . There are good pairs.

v) If the prime factor set of is , then , , can only be or . So, there are two good pairs.

vi) If the prime factor set of is , then , , can only be , , or . So, there are four good pairs.

vii) If the prime factor set of is then we have the following: when , , can only be , , , or ; when , , can only be , or ; when , , can only be . There are good pairs.

viii) If the prime factor set of is , then we have the following: when , , can only be , , , or ; when , , then can only be , , , or ; when , , then can only be , , , or ; when , , then can only be , or ; when , , then can only be . There are good pairs.

Therefore, there are all together good pairs.
Final answer
96

Techniques

Greatest common divisors (gcd)Factorization techniquesTechniques: modulo, size analysis, order analysis, inequalities