benchmarks.wiki / Public workspace

Omni-MATH / Let m,n>2 be integers. One of the angles of a regular n-gon is dissected into m angles of equal size by (m−1) rays. If each of these rays intersects the polygon again at one of its…

Problem

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

problem

Let m,n>2m, n > 2 be integers. One of the angles of a regular nn-gon is dissected into mm angles of equal size by (m−1)(m-1) rays. If each of these rays intersects the polygon again at one of its vertices, we say nn is mm-cut. Compute the smallest positive integer nn that is both 3-cut and 4-cut.
Plain-text mathematical notation (without MathML)
Let m,n>2 be integers. One of the angles of a regular n-gon is dissected into m angles of equal size by (m−1) rays. If each of these rays intersects the polygon again at one of its vertices, we say n is m-cut. Compute the smallest positive integer n that is both 3-cut and 4-cut.
Original LaTeX notation
Let $m, n > 2$ be integers. One of the angles of a regular $n$-gon is dissected into $m$ angles of equal size by $(m-1)$ rays. If each of these rays intersects the polygon again at one of its vertices, we say $n$ is $m$-cut. Compute the smallest positive integer $n$ that is both 3-cut and 4-cut.

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