benchmarks.wiki / Public workspace

Omni-MATH / Let D be a regular ten-sided polygon with edges of length 1. A triangle T is defined by choosing three vertices of D and connecting them with edges. How many different (non-congrue…

Problem

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

problem

Let DD be a regular ten-sided polygon with edges of length 1. A triangle TT is defined by choosing three vertices of DD and connecting them with edges. How many different (non-congruent) triangles TT can be formed?
Plain-text mathematical notation (without MathML)
Let D be a regular ten-sided polygon with edges of length 1. A triangle T is defined by choosing three vertices of D and connecting them with edges. How many different (non-congruent) triangles T can be formed?
Original LaTeX notation
Let $D$ be a regular ten-sided polygon with edges of length 1. A triangle $T$ is defined by choosing three vertices of $D$ and connecting them with edges. How many different (non-congruent) triangles $T$ can be formed?

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