Difference between revisions of "1991 AJHSME Problems/Problem 5"
5849206328x (talk | contribs) (Created page with '==Problem== A "domino" is made up of two small squares: <asy> unitsize(12); fill((0,0)--(1,0)--(1,1)--(0,1)--cycle,black); draw((1,1)--(2,1)--(2,0)--(1,0)); </asy> Which of the…') |
|||
Line 46: | Line 46: | ||
{{AJHSME box|year=1991|num-b=4|num-a=6}} | {{AJHSME box|year=1991|num-b=4|num-a=6}} | ||
[[Category:Introductory Number Theory Problems]] | [[Category:Introductory Number Theory Problems]] | ||
+ | {{MAA Notice}} |
Latest revision as of 23:06, 4 July 2013
Problem
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?
Solution
For a bunch of dominoes to completely tile a board, the board must have an even number of squares. The board clearly does not, so cannot be tiled completely.
See Also
1991 AJHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 4 |
Followed by Problem 6 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.