Erdős Problem 1089

### What is the conjecture

https://www.erdosproblems.com/1089

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?

Status:solved

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else

The payload names no repository files, tests, or entry points; begin by reading the linked Erdős Problem 1089 statement and the repository’s existing formalized conjectures. Done means this conjecture has been added as a Lean formalization in the project.

Written by the indexing model from the issue text.