Number theoryDifficulty 7.9National olympiad, round 2Prove itChina
Let n be a positive integer, set A⊆{1,2,…,n}, and for every a,b∈A, lcm(a,b)≤n. Prove that ∣A∣≤1.9n+5.
Solution
Proof For a∈(n,2n], lcm(a,a+1)=a(a+1)>n, so ∣A∩(n,2n]∣≤21(2−1)n+1. For a∈(2n,3n], we have lcm(a,a+1)=a(a+1)>n, lcm(a+1,a+2)=(a+1)(a+2)>n, lcm(a,a+2)≥21a(a+2)>n. So ∣A∩(2n,3n]∣≤31(3−2)n+1. Similarly ∣A∩(3n,2n]∣≤41(4−3)n+1. Hence ∣A∩[1,2n]∣≤n+21(2−1)n+31(3−2)n+41(4−3)n+3=(1+62+123)n+3. Let k∈N∗, suppose a,b∈(k+1n,kn), a>b, and lcm(a,b)=as=bt, where s,t∈N∗. Then (a,b)sa=(a,b)tb. Since gcd((a,b)a,(a,b)b)=1, so (a,b)b∣s. It follows that lcm(a,b)=as≥(a,b)ab≥a−bab=b+a−bb2>k+1n+kn−k+1n(k+1n)2=n. Therefore, ∣A∩(k+1n,kn)∣≤1. Suppose T∈N∗ such that T+1n≤2n<Tn. Then ∣A∩(2n,n]∣≤k=1∑TA∩(k+1n,kn]≤T<21n. By the above arguments, we arrive at ∣A∣≤(23+612+1213)n+3<1.9n+5.
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 and solution reproduced as published; topic and difficulty added by this site.