Erdős Problem #95 — The squared multiplicities of planar distances

About 31 years old · traced to

For nn points in the plane, let sis_i be the number of pairs at the iith distinct distance. Is Σisi2<n3+εΣ_i s_i^2<n^{3+ε} for every fixed ε>0ε>0 and all sufficiently large nn?

References

Additional references

P. Erdős, Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas 2 (1995), 165–186.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.