benchmarks.wiki / Public workspace

MATH / How many ways can I put down two indistinguishable pieces on an ordinary…

Problem

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

problem

How many ways can I put down two indistinguishable pieces on an ordinary 8×88\times 8 chessboard, if the pieces must either be in the same row or be in the same column?
Plain-text mathematical notation (without MathML)
How many ways can I put down two indistinguishable pieces on an ordinary 8×8 chessboard, if the pieces must either be in the same row or be in the same column?
Original LaTeX notation
How many ways can I put down two indistinguishable pieces on an ordinary $8\times 8$ chessboard, if the pieces must either be in the same row or be in the same column?

level

Level 5

type

Prealgebra

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