benchmarks.wiki / Public workspace

Omni-MATH / 2500 chess kings have to be placed on a 100×100 chessboard so that

Problem

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

problem

2500 chess kings have to be placed on a 100×100100 \times 100 chessboard so that [b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex); [b](ii)[/b] each row and each column contains exactly 25 kings. Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.) [i]
Plain-text mathematical notation (without MathML)
2500 chess kings have to be placed on a 100×100 chessboard so that

[b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex);
[b](ii)[/b] each row and each column contains exactly 25 kings.

Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.)

[i]
Original LaTeX notation
2500 chess kings have to be placed on a $100 \times 100$ chessboard so that

[b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex);
[b](ii)[/b] each row and each column contains exactly 25 kings.

Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.)

[i]

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

Official source

initial import