Skip to main content
OlympiadHQ

Browse · MathNet

Print

74th Romanian Mathematical Olympiad

Romania number theory

Problem

Let be a composite positive integer and let be the divisors of , where . Assume that all the equations , for have real solutions. Prove that for some prime number .
Solution
for any . As is the smallest proper divisor of , it means that the number is the greatest proper divisor of , so . We have: It follows that all inequalities (*) turn into equalities. Thus, for any . It follows that the numbers (in this order) are consecutive terms of a geometric progression of ratio , so . The lowest proper divisor of the composite number is a prime number , so , and .

Techniques

Factorization techniquesPrime numbersLinear and quadratic inequalities