benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Consider an m-by-n grid of unit squares, indexed by (i,j) with 1≤i≤m and 1≤j≤n. There are (m−1)(n−1) coins, which are initially placed in the squares (i,j) with 1≤i≤m−1 and 1≤j≤n−1… · Discussion

Discussing Consider an m-by-n grid of unit squares, indexed by (i,j) with 1≤i≤m and 1≤j≤n. There are (m−1)(n−1) coins, which are initially placed in the squares (i,j) with 1≤i≤m−1 and 1≤j≤n−1… · 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.