PPL 083 / 177 permanent IDsPrize Problem Ledger · PPLChecked 2026.07.26
Prize Problem LedgerPPL · Open reward indexAll 177 problems
Prize Problem LedgerErdősPPL 083Erdős Problem #89

Permanent problem IDPPL 083

Verified openErdősconjecture

Geometry

Erdős Problem #89

Does every set of n distinct points in ℝ^2 determine ≫ n/√(log n) many distinct distances?

geometrydistances
01

The problem

Does every set of n distinct points in ℝ^2 determine ≫ n/√(log n) many distinct distances?

Open since1946exact
Last checked2026.07.26Catalog verification
02

Reward offers

Offer 01$500Paul Erdős / Combinatorics Foundation
Documented

A solution must appear in a reputable journal, with documentation that Erdős offered the displayed amount. Claims are administered by the Combinatorics Foundation; erdosproblems.com does not pay awards.

Award source ↗Rules ↗
03

Sources & reading

4 unique reference linksCanonical problem page Claim or award rules OEIS A186704 OEIS A131628
04

Related open targets

GeometryErdős Problem #604PPL 067 · $500 · 69 years openGeometryErdős Problem #101PPL 034 · $100 · 52 years openGeometryErdős Problem #104PPL 036 · $100 · 51 years open