benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Given an 8×8 checkerboard with alternating white and black squares, how many ways are there to choose four black squares and four white squares so that no two of the eight chosen s…

Problem

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

problem

Given an 8×88 \times 8 checkerboard with alternating white and black squares, how many ways are there to choose four black squares and four white squares so that no two of the eight chosen squares are in the same row or column?
Plain-text mathematical notation (without MathML)
Given an 8×8 checkerboard with alternating white and black squares, how many ways are there to choose four black squares and four white squares so that no two of the eight chosen squares are in the same row or column?
Original LaTeX notation
Given an $8 \times 8$ checkerboard with alternating white and black squares, how many ways are there to choose four black squares and four white squares so that no two of the eight chosen squares are in the same row or column?

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
6042bf6a-7e50-5fb5-b5ac-0db8ea3bb2bd
task_key
test--6042bf6a-7e50-5fb5-b5ac-0db8ea3bb2bd
task_revision_id
1
config / split
/ test

Official source

initial import