benchmarks.wiki / Public workspace

Omni-MATH / Some squares of a n×n table (n>2) are black, the rest are white. In every white square we write the number of all the black squares having at least one common vertex with it. Find … · Discussion

Discussing Some squares of a n×n table (n>2) are black, the rest are white. In every white square we write the number of all the black squares having at least one common vertex with it. Find … · 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.