Browse · MathNet
Print67th NMO Selection Tests for BMO and IMO
Romania number theory
Problem
Given positive integers and , show that and are coprime for infinitely many integers .
Solution
Let , where is an arbitrary nonnegative integer, let be any prime factor of , and let be the highest power of that divides — that is, divides but does not. Notice that , to deduce that , so is also the highest power of that divides the product . Consequently, does not divide , so and are indeed coprime.
Techniques
Greatest common divisors (gcd)Factorization techniquesAlgebraic properties of binomial coefficients