benchmarks.wiki

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…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Each square in a 3×103 \times 10 grid is colored black or white. Let NN 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 squares below) are all white or all black. Determine N\sqrt{N}.
Plain-text mathematical notation (without MathML)
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 squares below) are all white or all black. Determine √(N).
Original LaTeX notation
Each square in a $3 \times 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 squares below) are all white or all black. Determine $\sqrt{N}$.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
4ef67911-d96d-59b2-a576-50c9a4f23e17
task_key
test--4ef67911-d96d-59b2-a576-50c9a4f23e17
task_revision_id
1
config / split
/ test

Official source

initial import