Problem 1089

Erdős Problem #1089: declared status 'solved'. Formalized: no. Let $g_d(n)$ be minimal such that every collection of $g_d(n)$ points in $\mathbb{R}^d$ determines at least $n$ many distinct distances. Estimate $g_d(n)$. In particular, does$$\lim_{d\to \infty}\frac{g_d(n)}{d^{n-1}}$$exist? Prize: no. Tags: distances, geometry.