Problem 92

Erdős Problem #92: declared status 'disproved'. Formalized: yes. Let $f(n)$ be maximal such that there exists a set $A$ of $n$ points in $\mathbb{R}^2$ in which every $x\in A$ has at least $f(n)$ points in $A$ equidistant from $x$. Is it true that $f(n)\leq n^{o(1)}$? Or even $f(n) < n^{O(1/\log\log n)}$? Prize: $500. Tags: distances, geometry.