benchmarks.wiki / Public workspace

Omni-MATH / A broken line consists of 31 segments. It has no self intersections, and its start and end points are distinct. All segments are extended to become straight lines. Find the least p…

Problem

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

problem

A broken line consists of 3131 segments. It has no self intersections, and its start and end points are distinct. All segments are extended to become straight lines. Find the least possible number of straight lines.
Plain-text mathematical notation (without MathML)
A broken line consists of 31 segments. It has no self intersections, and its start and end points are distinct. All segments are extended to become straight lines. Find the least possible number of straight lines.
Original LaTeX notation
A broken line consists of $31$ segments. It has no self intersections, and its start and end points are distinct. All segments are extended to become straight lines. Find the least possible number of straight lines.

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