Skip to main content
OlympiadHQ

Browse · MathNet

Print

BMO 2022 shortlist

2022 number theory

Problem

Let , , be positive integers such that: (i) and (ii) and . Prove that there is a subset of the divisors of the number having sum of elements divisible by but not by .
Solution
Solution 1. Write and where and . Then divides . Furthermore .

Case 1: Assume . Since , we may assume that is odd. Then works. Indeed each of these six divisors of is congruent to so their sum is a multiple of but not of . If then the sum is while if then each of these divisors is so the sum is again . Therefore the sum is a multiple of but not of .

Case 2: Assume . Then and since then . Consider the divisors of of the form where . Since none of them is a multiple of , they have at most distinct remainders modulo . Therefore at least of them have the same remainder modulo . Pick out of those, say . Let be their sum. We claim that there is a subset of of them that will work. Note that the sum of any such subset is a multiple of . It is enough to show that there is such a subset whose sum is not divisible by . If this is not the case then for each . In particular, all are congruent mod . Say that for each . Then and so the sum of any of them is congruent to .

---

Alternative solution.

We start with the following claim: Claim. If is a positive integer, then . Proof of the Claim. We have that is divisible by and taking the -root we get the desired result.

Back to the problem, we will prove that the set consisting of divisors of , has the desired property. The sum of its elements is equal to On the other hand, the last sum is equal to . We will prove that this is not divisible by . Indeed, if then, since , by the Lifting the Exponent Lemma, we have that . This implies that is not divisible by , therefore, doesn't divide .

Techniques

Greatest common divisors (gcd)Modular ArithmeticPigeonhole principleSums and products