benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / A convex 2019-gon A₁A₂…A₂₀₁₉ is cut into smaller pieces along its 2019 diagonals of the form A_(i)A_(i+3) for 1≤i≤2019, where A₂₀₂₀=A₁,A₂₀₂₁=A₂, and A₂₀₂₂=A₃. What is the least pos…

Problem

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

problem

A convex 2019-gon A1A2…A2019A_{1}A_{2}\ldots A_{2019} is cut into smaller pieces along its 2019 diagonals of the form AiAi+3A_{i}A_{i+3} for 1≤i≤20191 \leq i \leq 2019, where A2020=A1,A2021=A2A_{2020}=A_{1}, A_{2021}=A_{2}, and A2022=A3A_{2022}=A_{3}. What is the least possible number of resulting pieces?
Plain-text mathematical notation (without MathML)
A convex 2019-gon A₁A₂…A₂₀₁₉ is cut into smaller pieces along its 2019 diagonals of the form A_(i)A_(i+3) for 1≤i≤2019, where A₂₀₂₀=A₁,A₂₀₂₁=A₂, and A₂₀₂₂=A₃. What is the least possible number of resulting pieces?
Original LaTeX notation
A convex 2019-gon \(A_{1}A_{2}\ldots A_{2019}\) is cut into smaller pieces along its 2019 diagonals of the form \(A_{i}A_{i+3}\) for \(1 \leq i \leq 2019\), where \(A_{2020}=A_{1}, A_{2021}=A_{2}\), and \(A_{2022}=A_{3}\). What is the least possible number of resulting pieces?

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
9b0e5f94-0973-5636-9881-cfcdf6971ac6
task_key
test--9b0e5f94-0973-5636-9881-cfcdf6971ac6
task_revision_id
1
config / split
/ test

Official source

initial import