Skip to main content
OlympiadHQ

Browse · MathNet

Print

55rd Ukrainian National Mathematical Olympiad - Third Round (Second Tour)

Ukraine number theory

Problem

Prove that number has no divisors in interval for every natural .
Solution
Suppose the opposite. Let Since Let , then , so has a divisor that is no less than and fulfills the assumption, therefore instead of we can examine a divisor , where . If , then , so , which is impossible in case of . If , then , thus , . In case of and : and - none of these numbers fulfills the condition. If , then is a contradiction. Thus, if number has a divisor , where , then the number has a divisor , where . It is also clear that . In such case, , so . Case : - it is impossible, because is not divisible by 3. Case : , - impossible. Case : , but , so this case is also impossible. Thus, we have the contradiction with the supposition, so the statement is proved.

Techniques

Greatest common divisors (gcd)Techniques: modulo, size analysis, order analysis, inequalitiesLinear and quadratic inequalities