Skip to main content
OlympiadHQ

Browse · MathNet

Print

National Math Olympiad

Slovenia number theory

Problem

Let , and be non-zero digits. Let be a prime number which divides the three-digit numbers and . Show that divides at least one of the numbers , and .
Solution
Since the prime number divides the numbers and , it must also divide their difference If divides we are done. If not, then divides , so or .

If then is divisible by . A number is divisible by if and only if the sum of its digits is divisible by , so divides . Hence, divides .

If then divides which implies that is divisible by . In this case divides .

Techniques

Divisibility / FactorizationModular Arithmetic