benchmarks.wiki / Public workspace

Omni-MATH / Let P be a polyhedron where every face is a regular polygon, and every edge has length 1. Each vertex of P is incident to two regular hexagons and one square. Choose a vertex V of …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Let PP be a polyhedron where every face is a regular polygon, and every edge has length 1. Each vertex of PP is incident to two regular hexagons and one square. Choose a vertex VV of the polyhedron. Find the volume of the set of all points contained in PP that are closer to VV than to any other vertex.
Plain-text mathematical notation (without MathML)
Let P be a polyhedron where every face is a regular polygon, and every edge has length 1. Each vertex of P is incident to two regular hexagons and one square. Choose a vertex V of the polyhedron. Find the volume of the set of all points contained in P that are closer to V than to any other vertex.
Original LaTeX notation
Let $P$ be a polyhedron where every face is a regular polygon, and every edge has length 1. Each vertex of $P$ is incident to two regular hexagons and one square. Choose a vertex $V$ of the polyhedron. Find the volume of the set of all points contained in $P$ that are closer to $V$ than to any other vertex.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import