google-deepmind / google-deepmind/formal-conjectures
Erdős Problem 217
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 327
Description
### What is the conjecture
https://www.erdosproblems.com/217
For which $n$ are there $n$ points in $\mathbb{R}^2$, no three on a line and no four on a circle, which determine $n-1$ distinct distances and so that (in some ordering of the distances) the $i$th distance occurs $i$ times?
Status: open
### Prerequisites needed
see also https://github.com/google-deepmind/formal-conjectures/issues/369, https://github.com/google-deepmind/formal-conjectures/issues/328 and #425 with similar hypothesis.
### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else
Contributor guide
Assessment
This issue has not been assessed yet.