benchmarks.wiki / Public workspace

Omni-MATH / We consider an n×n table, with n≥1. Aya wishes to color k cells of this table so that that there is a unique way to place n tokens on colored squares without two tokens are not in … · Discussion

Discussing We consider an n×n table, with n≥1. Aya wishes to color k cells of this table so that that there is a unique way to place n tokens on colored squares without two tokens are not in … · 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.