Given a set (Xsubseteqmathbb{R}^2) of (n) points and a distance (d>0), the multiplicity of (d) is the number of times the distance (d) appears between points in (X). Let (a_1(X) geq a_2(X) geq cdots geq a_m(X)) denote the multiplicities of the (m) distances determined by (X) and let (a(X)=(a_1(X),dots,a_m(X))). In this paper, we study several questions from Erdős’s time regarding distance multiplicities. Among other results, we show that: