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… · Discussion

Discussing 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… · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.