Four color theorem

Four Color Theorem

The four color theorem is a fun idea about maps. It says that if you want to color a map, you only need four colors. No two places that share a border can have the same color. This makes map coloring easier and neater!

People have known about this idea for a long time. It was first noticed in 1852 by Francis Guthrie. Many smart people tried to prove it was true, but it was very hard. Finally, in 1976, Kenneth Appel and Wolfgang Haken proved it using a computer. This was the first big math problem solved with a computer, which was very exciting!

The four color theorem works for any flat map. It even works for very big maps that can be drawn without lines crossing. Map makers usually don’t need more than three colors for real maps, but this rule helps us know that four colors are always enough if we ever did need them.

Here’s a picture of a map colored with four colors:

The four color theorem shows us how math can solve real-world problems in a clever way!