Skip to main content
OlympiadHQ

Browse · MathNet

Print

48th International Mathematical Olympiad Vietnam 2007 Shortlisted Problems with Solutions

2007 number theory

Problem

Let , be integers. Suppose that for each there exists an integer such that is divisible by . Prove that for some integer .
Solution
Let the prime factorization of be , where are distinct primes. Our goal is to show that all exponents are divisible by , then we can set .

Apply the condition for . The number is divisible by and hence, for each , it is divisible by as well. Therefore and which implies that the largest power of dividing is . Since is a complete th power, this implies that is divisible by .

Techniques

Factorization techniquesPrime numbersTechniques: modulo, size analysis, order analysis, inequalities