benchmarks.wiki / Public workspace

Omni-MATH / There are n line segments on the plane, no three intersecting at a point, and each pair intersecting once in their respective interiors. Tony and his 2n−1 friends each stand at a d… · Discussion

Discussing There are n line segments on the plane, no three intersecting at a point, and each pair intersecting once in their respective interiors. Tony and his 2n−1 friends each stand at a d… · 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.