Given a positive integer n, let D denote the set of all positive divisors of n. Let A and B be subsets of D satisfying: for any a∈A and b∈B, we have a∤b and b∤a. Prove that ∣A∣+∣B∣≤∣D∣.
Solution
Proof: Decompose D into the following disjoint unions D=X⊔Y⊔Z⊔W, where X={x∈D:∃a∣x,∃b∣x},Y={x∈D:∃a∣x,∄b∣x}, Z={x∈D:∄a∣x,∃b∣x},W={x∈D:∄a∣x,∄b∣x}. Note that the assumption of the problem indicates that A⊆Y,B⊆Z. It suffices to prove a stronger statement: for any two nonempty subsets A,B of D, we always have ∣Y∣+∣Z∣≤∣D∣. This inequality is equivalent to ∣Y∣+∣Z∣+2∣Y∣⋅∣Z∣≤∣D∣=∣X∣+∣Y∣+∣Z∣+∣W∣⟺2∣Y∣⋅∣Z∣≤∣X∣+∣W∣, This inequality is implied by ∣Y∣⋅∣Z∣≤∣X∣⋅∣W∣, which can be further rewritten as (∣X∣+∣Y∣)(∣X∣+∣Z∣)=∣X∣(∣X∣+∣Y∣+∣Z∣)+∣Y∣⋅∣Z∣≤∣X∣(∣X∣+∣Y∣+∣Z∣)+∣X∣⋅∣W∣=∣X∣⋅∣D∣. Let U=X∪Y and V=X∪Z. Then the above inequality becomes ∣U∣⋅∣V∣≤∣U∩V∣⋅∣D∣. Note that U={x∈D:∃a∣x} satisfies: if x∈U and x∣x′, then x′∈U. Call such subsets of D upward-closed. Similarly, V={x∈D:∃b∣x} is also an upward-closed subset of D. Next, we prove: for any two nonempty upward-closed subsets U,V of D, we have ∣U∣⋅∣V∣≤∣U∩V∣⋅∣D∣. Let n=p1α1⋯pkαk be the prime factorization of n, and we make an induction on k. Write p and α for pk and αk, respectively, for simplicity. Set n=pαn′. Define Dk={x∈D∣vp(x)=k}, Uk=U∩Dk, and Vk=V∩Dk. For every k=0,1,…,α−1, for any x∈Uk, the upward-closure property of U implies that px∈Uk+1. This means that ∣Uk∣≤∣Uk+1∣, i.e. {∣Uk∣}k is increasing. Similarly, {∣Vk∣}k is increasing. Note that pk1Uk and pk1Vk are upward-closed subsets of pk1Dk=D(n′). But inductive hypothesis, we have ∣(pk1Uk)∩(pk1Vk)∣≥∣D(n′)∣1⋅∣(pk1Uk)∣⋅∣(pk1Vk)∣, So we have ∣Uk∩Vk∣≥∣D∣1+α∣Uk∣⋅∣Vk∣. Using rearrangement inequality, we get ∣U∩V∣=k=0∑α∣Uk∩Vk∣≥∣D∣1+αk=0∑α∣Uk∣⋅∣Vk∣≥∣D∣1+α⋅1+α1(k=0∑α∣Uk∣)⋅(k=0∑α∣Vk∣)=∣D∣1∣U∣⋅∣V∣.
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.