Let S be a set of n>1 distinct integers and suppose that T={x+y:x=y,x,y∈S} has exactly 2n−3 distinct elements. Prove that, when arranged in increasing order, the elements of S form an arithmetic progression.
Solution
Write S={x1,…,xn} where x1<⋯<xn. The 2n−3 elements x1+x2<⋯<x1+xn<x2+xn<x3+xn<⋯<xn−1+xn account for all the elements of T. Now x2+xn−1 lies between x1+xn−1 and x2+xn, so it must be x1+xn. So x2−x1=xn−xn−1=d, say. Proceeding by induction, having shown that xi−xi−1=d, for some 2≤i<n−1, observe that xi+1+xn−1 lies between xi+xn−1=xi−1+xn and xi+1+xn, so xi+1+xn−1=xi+xn, giving xi+1−xi=d.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.