benchmarks.wiki / Public workspace

Omni-MATH / We have an n-gon, and each of its vertices is labeled with a number from the set 1,…,10. We know that for any pair of distinct numbers from this set there is at least one side of… · Discussion

Discussing We have an n-gon, and each of its vertices is labeled with a number from the set {1,…,10}. We know that for any pair of distinct numbers from this set there is at least one side of… · 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.