benchmarks.wiki / Public workspace

Omni-MATH / A k×k array contains each of the numbers 1,2,…,m exactly once, with the remaining entries all zero. Suppose that all the row sums and column sums are equal. What is the smallest po… · Discussion

Discussing A k×k array contains each of the numbers 1,2,…,m exactly once, with the remaining entries all zero. Suppose that all the row sums and column sums are equal. What is the smallest po… · 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.