benchmarks.wiki / Public workspace

Omni-MATH / A positive integer n is infallible if it is possible to select n vertices of a regular 100-gon so that they form a convex, non-self-intersecting n-gon having all equal angles. Find…

Problem

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

problem

A positive integer nn is infallible if it is possible to select nn vertices of a regular 100-gon so that they form a convex, non-self-intersecting nn-gon having all equal angles. Find the sum of all infallible integers nn between 3 and 100, inclusive.
Plain-text mathematical notation (without MathML)
A positive integer n is infallible if it is possible to select n vertices of a regular 100-gon so that they form a convex, non-self-intersecting n-gon having all equal angles. Find the sum of all infallible integers n between 3 and 100, inclusive.
Original LaTeX notation
A positive integer $n$ is infallible if it is possible to select $n$ vertices of a regular 100-gon so that they form a convex, non-self-intersecting $n$-gon having all equal angles. Find the sum of all infallible integers $n$ between 3 and 100, inclusive.

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