Skip to content

Erdős problem 755

Erdős asked whether every nn-point set in R6\mathbb{R}^6 spans at most (1/27+o(1))n3(1/27 + o(1)) n^3 unit equilateral triangles.

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:5f9fef062e59bde4573a0ad95622e18cefdd75e08ee543fe56c01592df6882d1
Metadata
sha256:ca7c07687deece21e76bf0d1bf7329ba42458a74a66325ceaf535cde12608963
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:6e3ec836aae77294c8894ec0604e67b96dbabfceb37e5731dc0e3b31e92b2743
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page