MathDB

Erdős Problem #660 — Let x1,…,xn∈R3x_1,\ldots,x_n\in \mathbb{R}^3 be the vertices of a convex polyhedron. Are there at least (1−o(1))n2(1-o(1))\frac{n}{2} many distinct distances between the xix_i?

About 51 years old · traced to

Let x1,…,xn∈R3x_1,\ldots,x_n\in \mathbb{R}^3 be the vertices of a convex polyhedron. Are there at least (1−o(1))n2(1-o(1))\frac{n}{2} many distinct distances between the xix_i?

References

Primary source

ULAM AI, UnsolvedMath dataset, Erdős Problems set, revision b9437975f3c873f635a13c48f8b022f5ba80898a; CC BY 4.0.

Additional references

UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.

convexdistancesgeometry
InErdős Problems
Posted · edited

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.