An introduction to a mathematical perspective on coloring the regions or countries of a map. The central problem is to try to use a few colors as possible to color the regions, yet not use so few that the regions aren't easily distinguished from one another.

Two stories, The Story of the Young Map Colorer and A Television Story bring the mathematical problem of map coloring to life.

Asking yourself why this procedure always seems to produce 2-colorable maps is an invitation to explore the idea of mathematical proof, as well as to make and color some interesting maps.

Also, remember that finding a **simple proof** of the 4 Color Theorem, (one that *won't* take a computer 1200 hours to complete) is still one of the greatest open problems in mathematics today.