Let S be a set of positive integers such that ⌊x⌋=⌊y⌋ for all x,y∈S. Show that the products xy, where x,y∈S, are pairwise distinct.
Solution
We first show that if x1,x2,x3,x4 are members of S such that x1x2≤x3x4, then x1+x2≤x3+x4. Suppose, if possible, that x1+x2>x3+x4. Let n=⌊x⌋, x∈S, and write xk=n2+wk, where the wk are non-negative integers less than 2n+1, to deduce that w1+w2−w3−w4≥1. The condition x1x2≤x3x4 yields (w1+w2−w3−w4)n2≤w3w4−w1w2, so w3>0 and n2≤(w1+w2−w3−w4)n2≤w3w4−w1w2<w3(w1+w2−w3)−w1w2=(w1−w3)(w3−w2)≤((w1−w3)+(w3−w2))2/4=(w1−w2)2/4≤n2, which is a contradiction.
Thus, if x1,x2,x3,x4 are members of S such that x1x2=x3x4, then x1+x2=x3+x4, so x12+x3x4=x1(x1+x2)=x1(x3+x4), i.e., (x1−x3)(x1−x4)=0 whence x1=x3 or x1=x4. The conclusion now follows at once.
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.