benchmarks.wiki / Public workspace

Omni-MATH / A path of length n is a sequence of points (x₁,y₁),(x₂,y₂),…,(x_(n),y_(n)) with integer coordinates such that for all i between 1 and n−1 inclusive, either (1) x_(i+1)=x_(i)+1 and … · Discussion

Discussing A path of length n is a sequence of points (x₁,y₁),(x₂,y₂),…,(x_(n),y_(n)) with integer coordinates such that for all i between 1 and n−1 inclusive, either (1) x_(i+1)=x_(i)+1 and … · 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.