Browse · MathNet
Print74th Romanian Mathematical Olympiad
Romania number theory
Problem
a) Prove that and are coprime, for every natural .
b) Find the number of the pairs of natural numbers for which there exists a natural number so that and .
b) Find the number of the pairs of natural numbers for which there exists a natural number so that and .
Solution
a) If is a common divisor of the numbers and , then divides the numbers and . Then divides , that is . So , hence the numbers and are coprime.
b) The relation leads to , hence . Since and are coprime, divides . Since
(it is the denominator of a fraction), there exists so that and therefore .
Replace and in to get . Then , whence .
For we get , so . For we get , so . For we get , so .
In total, there are 8 pairs.
b) The relation leads to , hence . Since and are coprime, divides . Since
(it is the denominator of a fraction), there exists so that and therefore .
Replace and in to get . Then , whence .
For we get , so . For we get , so . For we get , so .
In total, there are 8 pairs.
Final answer
8
Techniques
Greatest common divisors (gcd)Techniques: modulo, size analysis, order analysis, inequalitiesLinear and quadratic inequalities