Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

counting and probability intermediate

Problem

What is the least number of colors needed to shade the tessellation shown, such that no two tiles sharing a side are the same color?

problem
Solution
Clearly one color isn't enough; colors will work because the tessellation shown is topologically identical to a chessboard (that is, imagine straightening out the diagonal lines to form an array of squares. This process doesn't change which tiles share a side.).
Final answer
2