CombinatoricsDifficulty 3.0AMC 10/12Find the answerUnited Kingdom
The diagram shows part of a tessellation of the plane by a quadrilateral. Khelen wants to colour each quadrilateral in the pattern so that no two quadrilaterals that meet (even at a point) have the same colour. What is the smallest number of colours he needs?
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.