Erdős Problem #1208 — Large distinct-distance subsets in Euclidean space

For fixed $d≥2$, let $F_d(n)$ be the largest integer such that every set of $n$ points in $R^d$ contains $F_d(n)$ points whose pairwise distances are all distinct. Determine the order of growth of $F_d(n)$.