olymmath

AMC 8 1991 Problem 5

  • Paper

A "domino" is made up of two small squares:

Which of the "checkerboards" illustrated below CANNOT be covered exactly and completely by a whole number of non-overlapping dominoes?

(A) 3×4(B) 3×5(C) 4×4(D) 4×5(E) 6×3\text{(A)}\ 3\times 4 \text{(B)}\ 3\times 5 \text{(C)}\ 4\times 4 \text{(D)}\ 4\times 5 \text{(E)}\ 6\times 3

Dataset text NuminaMath-1.5. Quoted with source.

Show the answer

B

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator amc8/1991/p5 · Tag JFTRKFYVM8 · Edit this page on GitHub · Keys: j next, k previous