Erdős problem 958 · problems.science

Let $A\subset \mathbb{R}^2$ be a finite set of size $n$ , and let $\{d_1,\ldots,d_k\}$ be the set of distances determined by $A$ . Let $f(d)$ be the multiplicity of $d$ , that is, the number of unordered pairs from $A$ of distance $d$ apart.

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#958
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI building on literature
Erdős AI contributions wiki · 27 Dec, 2025
Machine
Aristotle
Open the source record
Formalization
Erdős AI contributions wiki · 19 Dec, 2025
Machine
Seed Prover 1.5
Open the source record

Reported activity

Search problems.science