benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / An arrangement of chips in the squares of n×n table is called [i]sparse[/i] if every 2×2 square contains at most 3 chips. Serge put chips in some squares of the table (one in a squ… · Discussion

Discussing An arrangement of chips in the squares of n×n table is called [i]sparse[/i] if every 2×2 square contains at most 3 chips. Serge put chips in some squares of the table (one in a squ… · 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.