Erdős unit-distance conjecture
Also written: Erdős distinct distances problem
A math problem about the minimum number of distinct distances among n points in a plane.
Imagine you have a set of dots on a piece of paper. The Erdős unit-distance conjecture is a math problem that asks: if you have 'n' dots, what's the smallest number of different distances you can possibly create between all pairs of those dots?
For example, if you have 4 dots, you could arrange them to make a square. In a square, there are only two different distances: the length of the sides and the length of the diagonals. The conjecture explores if you can always find arrangements that limit the number of distances, especially as you add more dots.
The Erdős unit-distance conjecture, posed by Paul Erdős in 1946, asks for the minimum number of distinct distances determined by n points in the Euclidean plane. Erdős conjectured this minimum is proportional to n / sqrt(log n). The problem has seen significant progress, with bounds approaching this conjecture, often involving constructions like grids or hexagonal lattices. It connects to various fields including discrete geometry and combinatorial number theory.
This term appears because AI is increasingly used to tackle complex mathematical problems. Frontier AI labs are highlighting how their models can accelerate research in theoretical fields like mathematics, potentially leading to breakthroughs on long-standing conjectures such as the Erdős unit-distance problem.
- Ten advances in mathematics and theoretical computer scienceOpenAI · OpenAI News ·
- How a reasoning model cracked an 80-year-old math problem - Episode 20OpenAI · The OpenAI Podcast ·
- OpenAI ChatGPT
- OpenAI's research highlights advances in mathematics and theoretical computer science, suggesting their models are being applied to problems like the Erdős unit-distance conjecture.
- Erdős distinct distances problem
- This is the same problem, often referred to by
- Unit circle
- A circle with a radius of one, used in trigonometry and geometry, u
The conjecture was posed by Hungarian mathematician Paul Erdős in 1946. It remains one of the most famous unsolved problems in discrete geometry. Source ↗
While directly testing the conjecture is complex, you can explore distance concepts in AI tools. Try asking a model like ChatGPT to 'describe the distances between the corners of a regular pentagon' and then 'describe the distances between the corners of a randomly placed set of 5 points' to see how it handles geometric descriptions.
The Playbook: reusable how-tos, prompts, configs and tips pulled out of the news.
- PromptRole-play a student struggling with math for AI tutor simulationSimulate a student's math struggles and uncertainty for AI tutor evaluation. · 5 min
- TemplateReusable workflow templates for healthcare teamsTeams can create and share templates for common workflows like documentation or prior authorizations. · 15 min
- TemplateTemplate for building an AI tool tailored to your workA structured approach to defining and building a custom AI tool for specific business needs. · 15 min
- TemplateEvals CSV prompt list for agent skillsA CSV file template for listing prompts used in evaluating agent skills. · 20 min
- HeuristicDouble coding agent task completion with docs linksProviding coding agents with a documentation link significantly increases their task completion rate. · 2 min
Questions people ask
- What is the main question of the conjecture?
- It asks for the smallest possible number of different distances you can find between all pairs of 'n' points placed on a flat surface.
- Has the conjecture been proven?
- No, the Erdős unit-distance conjecture is still an open problem in mathematics, though significant progress has been made towards understanding it.
First seen on Subvolts Aug 1, 2026. Updated Sep 15, 2026. Written by an AI model from the items above and reviewed against them weekly; report an error.