Skip to content

Erdős problem 659

Start work

Is there a set of nn points in R2\mathbb{R}^2 such that every subset of 44 points determines at least 33 distances, yet the total number of distinct distances is ≪nlog⁡n\ll \frac{n}{\sqrt{\log n}}?

Workspace

Continue locallyOpen sourceSign in to contribute

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public

  2. Work on it, wherever you work.

    Your machine

  3. Keep an Approach and its Attempts here.

    Needs an account

  4. Attach evidence by its content root.

    Needs an account

  5. Prepare an unsigned Submission draft.

    Needs an account

  6. Sign it with your own key.

    Your machine

  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. Not reviewed here.

  • AI alongside literature

    Erdős AI contributions wiki · 2 Feb, 2026

    Machine
    Aletheia
    Open the source record

  • Formalization

    Erdős AI contributions wiki · 14 Jan, 2026

    Machine
    Aristotle
    Open the source record

  • AI collaborating with humans

    Erdős AI contributions wiki · 13 Jan, 2026

    Machine
    Gemini 3
    People
    Benjamin Grayzel
    Open the source record

  • argument

    VibeMathed

    Machine
    Gemini 3, Aletheia
    People
    Benjamin Grayzel
    Reported outcome
    resolved
    Open the source record