benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Find all integers n and m, n>m>2, and such that a regular n-sided polygon can be inscribed in a regular m-sided polygon so that all the vertices of the n-gon lie on the sides of th…

Problem

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

problem

Find all integers nn and mm, n>m>2n > m > 2, and such that a regular nn-sided polygon can be inscribed in a regular mm-sided polygon so that all the vertices of the nn-gon lie on the sides of the mm-gon.
Plain-text mathematical notation (without MathML)
Find all integers n and m, n>m>2, and such that a regular n-sided polygon can be inscribed in a regular m-sided polygon so that all the vertices of the n-gon lie on the sides of the m-gon.
Original LaTeX notation
Find all integers $n$ and $m$, $n > m > 2$, and such that a regular $n$-sided polygon can be inscribed in a regular $m$-sided polygon so that all the vertices of the $n$-gon lie on the sides of the $m$-gon.

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

task_id
f2763365-b02c-5f17-8156-c8535e4a03e1
task_key
test--f2763365-b02c-5f17-8156-c8535e4a03e1
task_revision_id
1
config / split
/ test

Official source

initial import