Browse · MathNet
Print58. National mathematical olympiad Final round
Bulgaria number theory
Problem
The positive integers are such that the equation has at least two distinct solutions in positive integers and . Prove that and are co-prime.
Solution
Assume that and are not co-prime and let the prime be their common divisor. We denote by the exact degree of which divides . Note that for every positive integer and does not divide if it divides .
Let and be two distinct solutions of the given equation and . Then which easily implies that . Subtracting the equalities and we obtain , whence and therefore . Now obviously implies that , which is a contradiction.
Let and be two distinct solutions of the given equation and . Then which easily implies that . Subtracting the equalities and we obtain , whence and therefore . Now obviously implies that , which is a contradiction.
Techniques
Greatest common divisors (gcd)Techniques: modulo, size analysis, order analysis, inequalitiesSums and products