Maths Olympiad Prep

Library / /97 of 106

, 2022

Number theory Difficulty 8.7 Shortlist Prove it China

Given a positive integer nn, let DD denote the set of all positive divisors of nn. Let AA and BB be subsets of DD satisfying: for any aAa \in A and bBb \in B, we have aba \nmid b and bab \nmid a. Prove that
A+BD. \sqrt{|A|} + \sqrt{|B|} \le \sqrt{|D|}.

Solution

Proof: Decompose DD into the following disjoint unions D=XYZWD = X \sqcup Y \sqcup Z \sqcup W, where
X={xD:ax,bx},Y={xD:ax,bx}, X = \{x \in D : \exists a | x, \exists b | x\}, \quad Y = \{x \in D : \exists a | x, \nexists b | x\},
Z={xD:ax,bx},W={xD:ax,bx}. Z = \{x \in D : \nexists a | x, \exists b | x\}, \quad W = \{x \in D : \nexists a | x, \nexists b | x\}.
Note that the assumption of the problem indicates that AY,BZA \subseteq Y, B \subseteq Z. It suffices to prove a stronger statement: for any two nonempty subsets A,BA, B of DD, we always have Y+ZD\sqrt{|Y|} + \sqrt{|Z|} \le \sqrt{|D|}. This inequality is equivalent to
Y+Z+2YZD=X+Y+Z+W    2YZX+W, |Y| + |Z| + 2\sqrt{|Y| \cdot |Z|} \le |D| = |X| + |Y| + |Z| + |W| \iff 2\sqrt{|Y| \cdot |Z|} \le |X| + |W|,
This inequality is implied by YZXW|Y| \cdot |Z| \le |X| \cdot |W|, which can be further rewritten as
(X+Y)(X+Z)=X(X+Y+Z)+YZX(X+Y+Z)+XW=XD. (|X|+|Y|)(|X|+|Z|) = |X|(|X|+|Y|+|Z|)+|Y|\cdot|Z| \le |X|(|X|+|Y|+|Z|)+|X|\cdot|W| = |X|\cdot|D|.
Let U=XYU = X \cup Y and V=XZV = X \cup Z. Then the above inequality becomes UVUVD|U| \cdot |V| \le |U \cap V| \cdot |D|.
Note that U={xD:ax}U = \{x \in D : \exists a | x\} satisfies: if xUx \in U and xxx | x', then xUx' \in U. Call such subsets of DD upward-closed. Similarly, V={xD:bx}V = \{x \in D : \exists b | x\} is also an upward-closed subset of DD.
Next, we prove: for any two nonempty upward-closed subsets U,VU, V of DD, we have UVUVD|U| \cdot |V| \le |U \cap V| \cdot |D|.
Let n=p1α1pkαkn = p_1^{\alpha_1} \cdots p_k^{\alpha_k} be the prime factorization of nn, and we make an induction on kk. Write pp and α\alpha for pkp_k and αk\alpha_k, respectively, for simplicity. Set n=pαnn = p^{\alpha}n'. Define Dk={xDvp(x)=k}D_k = \{x \in D | v_p(x) = k\}, Uk=UDkU_k = U \cap D_k, and Vk=VDkV_k = V \cap D_k. For every k=0,1,,α1k = 0, 1, \dots, \alpha - 1, for any xUkx \in U_k, the upward-closure property of UU implies that pxUk+1px \in U_{k+1}. This means that UkUk+1|U_k| \le |U_{k+1}|, i.e. {Uk}k\{|U_k|\}_k is increasing. Similarly, {Vk}k\{|V_k|\}_k is increasing. Note that 1pkUk\frac{1}{p^k}U_k and 1pkVk\frac{1}{p^k}V_k are upward-closed subsets of 1pkDk=D(n)\frac{1}{p^k}D_k = D(n'). But inductive hypothesis, we have
(1pkUk)(1pkVk)1D(n)(1pkUk)(1pkVk), |(\frac{1}{p^k}U_k) \cap (\frac{1}{p^k}V_k)| \ge \frac{1}{|D(n')|} \cdot |(\frac{1}{p^k}U_k)| \cdot |(\frac{1}{p^k}V_k)|,
So we have UkVk1+αDUkVk|U_k \cap V_k| \ge \frac{1+\alpha}{|D|} |U_k| \cdot |V_k|. Using rearrangement inequality, we get
UV=k=0αUkVk1+αDk=0αUkVk1+αD11+α(k=0αUk)(k=0αVk)=1DUV. \begin{aligned} |U \cap V| &= \sum_{k=0}^{\alpha} |U_k \cap V_k| \ge \frac{1+\alpha}{|D|} \sum_{k=0}^{\alpha} |U_k| \cdot |V_k| \\ &\ge \frac{1+\alpha}{|D|} \cdot \frac{1}{1+\alpha} \left( \sum_{k=0}^{\alpha} |U_k| \right) \cdot \left( \sum_{k=0}^{\alpha} |V_k| \right) \\ &= \frac{1}{|D|} |U| \cdot |V|. \end{aligned}

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.