benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Find all integers n≥3 for which every convex equilateral n-gon of side length 1 contains an equilateral triangle of side length 1. (Here, polygons contain their boundaries.)

Problem

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

problem

Find all integers n≥3n\geq 3 for which every convex equilateral nn-gon of side length 11 contains an equilateral triangle of side length 11. (Here, polygons contain their boundaries.)
Plain-text mathematical notation (without MathML)
Find all integers n≥3 for which every convex equilateral n-gon of side length 1 contains an equilateral triangle of side length 1. (Here, polygons contain their boundaries.)
Original LaTeX notation
Find all integers $n\geq 3$ for which every convex equilateral $n$-gon of side length $1$ contains an equilateral triangle of side length $1$. (Here, polygons contain their boundaries.)

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
76a80270-8ca4-547d-8d79-d031f705a119
task_key
test--76a80270-8ca4-547d-8d79-d031f705a119
task_revision_id
1
config / split
/ test

Official source

initial import