benchmarks.wiki / Public workspace

Omni-MATH / Each square in a 3×10 grid is colored black or white. Let N be the number of ways this can be done in such a way that no five squares in an 'X' configuration (as shown by the black… · Discussion

Discussing Each square in a 3×10 grid is colored black or white. Let N be the number of ways this can be done in such a way that no five squares in an 'X' configuration (as shown by the black… · 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.