benchmarks.wiki / Public workspace

Omni-MATH / Consider a 2×n grid of points and a path consisting of 2n−1 straight line segments connecting all these 2n points, starting from the bottom left corner and ending at the upper righ… · Discussion

Discussing Consider a 2×n grid of points and a path consisting of 2n−1 straight line segments connecting all these 2n points, starting from the bottom left corner and ending at the upper righ… · 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.