benchmarks.wiki / Public workspace

Omni-MATH / Let n≥3 be an integer. Rowan and Colin play a game on an n×n grid of squares, where each square is colored either red or blue. Rowan is allowed to permute the rows of the grid, and… · Discussion

Discussing Let n≥3 be an integer. Rowan and Colin play a game on an n×n grid of squares, where each square is colored either red or blue. Rowan is allowed to permute the rows of the grid, and… · 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.