With the rules established, here are some questions with surprising answers. For example, Utah and New Mexico famously only touch at a corner and so do not count as neighbors for our purposes. For two regions to count as adjacent, they must share some contiguous border touching at a single point (or discrete set of points) doesn’t qualify. The question is, given any such map, what is the minimum number of colors required to fill in each region so that no two adjacent regions have the same color? Some ground rules: each region must be contiguous, so technically Michigan violates the setup because Lake Michigan severs the state into two disconnected parts. The map doesn’t need to correspond to real geography-any partitioning of a flat surface into distinct regions qualifies. Could we have done it with only three? Might other maps require five or six? Under this constraint, we used four colors to fill in the map above. Naturally, we don’t want neighboring states to have the same color, because that would make the boundaries more confusing.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |