Skip to content

Erdős problem 213

Let n≥4n \geq 4. Are there nn points in R2\mathbb{R}^2, no three on a line and no four on a circle, such that all pairwise distances are integers?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:a73227a6007ee8a0c68aac41af607b6c8c3f105b77092dfb757824be62cf6cfa
Metadata
sha256:b60a00068dd03282bab4a2a55309fd2834483855e440198275c9121ed41c0caf
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:99d7fbee1c3e13b1335ecda1cd27af0917f2a2d298337466112dc6a07a6fc3e1
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb