Browse · MathNet
PrintEstonian Math Competitions
Estonia number theory
Problem
(a) Is it true that, for arbitrary integer greater than and distinct positive integers and not greater than , the set of any consecutive integers contains distinct numbers and whose product is divisible by the product ?
(b) Is it true that, for arbitrary integer greater than and distinct positive integers not greater than , the set of any consecutive integers contains distinct numbers whose product is divisible by the product ?
(b) Is it true that, for arbitrary integer greater than and distinct positive integers not greater than , the set of any consecutive integers contains distinct numbers whose product is divisible by the product ?
Solution
Answer: (a) Yes; (b) No.
(a) Consider consecutive integers . As , there must be a multiple of among them; denote it . As , there must also be a multiple of among them. If then one may choose ; then the product is divisible by the product . Suppose in the rest that ; then as a common multiple of and is divisible by . Note that if then could not have two distinct multiples and among . Thus , which in turn implies that must have two distinct multiples among . At least one of them differs from ; let that be . Then the product is divisible by the product which equals .
(b) Let and , , and ; then . We show that among consecutive integers , where , no three distinct numbers can have a product divisible by . For that, note that the largest number less than that is divisible by at least two numbers among and is , and similarly, the least number greater than that is divisible by at least two numbers among and is . Both lie outside the region under consideration. Consequently, at most one prime among and can belong to the canonical representation of any of the numbers . Now choose any three numbers among . Let be among these three numbers. The primes and have exponent in its canonical representation. As shown above, only one of these three primes can occur in the canonical representation of either of the other two chosen numbers. Thus the product of the chosen three numbers cannot be divisible by . Let all these three numbers differ from . As shown above, each of these numbers can be divisible by at most one prime among and . Hence, for their product to be divisible by , one of the numbers should be divisible by . But which implies . Thus the nearest to numbers divisible by are and which lie outside the region under consideration. Consequently, the product of the chosen three number cannot be divisible by .
(a) Consider consecutive integers . As , there must be a multiple of among them; denote it . As , there must also be a multiple of among them. If then one may choose ; then the product is divisible by the product . Suppose in the rest that ; then as a common multiple of and is divisible by . Note that if then could not have two distinct multiples and among . Thus , which in turn implies that must have two distinct multiples among . At least one of them differs from ; let that be . Then the product is divisible by the product which equals .
(b) Let and , , and ; then . We show that among consecutive integers , where , no three distinct numbers can have a product divisible by . For that, note that the largest number less than that is divisible by at least two numbers among and is , and similarly, the least number greater than that is divisible by at least two numbers among and is . Both lie outside the region under consideration. Consequently, at most one prime among and can belong to the canonical representation of any of the numbers . Now choose any three numbers among . Let be among these three numbers. The primes and have exponent in its canonical representation. As shown above, only one of these three primes can occur in the canonical representation of either of the other two chosen numbers. Thus the product of the chosen three numbers cannot be divisible by . Let all these three numbers differ from . As shown above, each of these numbers can be divisible by at most one prime among and . Hence, for their product to be divisible by , one of the numbers should be divisible by . But which implies . Thus the nearest to numbers divisible by are and which lie outside the region under consideration. Consequently, the product of the chosen three number cannot be divisible by .
Final answer
(a) Yes; (b) No
Techniques
Greatest common divisors (gcd)Least common multiples (lcm)Prime numbersFactorization techniquesModular Arithmetic