benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / In △ABC,AB=2019,BC=2020, and CA=2021. Yannick draws three regular n-gons in the plane of △ABC so that each n-gon shares a side with a distinct side of △ABC and no two of the n-gons…

Problem

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

problem

In △ABC,AB=2019,BC=2020\triangle A B C, A B=2019, B C=2020, and CA=2021C A=2021. Yannick draws three regular nn-gons in the plane of △ABC\triangle A B C so that each nn-gon shares a side with a distinct side of △ABC\triangle A B C and no two of the nn-gons overlap. What is the maximum possible value of nn?
Plain-text mathematical notation (without MathML)
In △ABC,AB=2019,BC=2020, and CA=2021. Yannick draws three regular n-gons in the plane of △ABC so that each n-gon shares a side with a distinct side of △ABC and no two of the n-gons overlap. What is the maximum possible value of n?
Original LaTeX notation
In $\triangle A B C, A B=2019, B C=2020$, and $C A=2021$. Yannick draws three regular $n$-gons in the plane of $\triangle A B C$ so that each $n$-gon shares a side with a distinct side of $\triangle A B C$ and no two of the $n$-gons overlap. What is the maximum possible value of $n$?

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
76915895-b8b7-5719-aa8d-3a247428c3db
task_key
test--76915895-b8b7-5719-aa8d-3a247428c3db
task_revision_id
1
config / split
/ test

Official source

initial import