The four-color problem ```Name: yendor Status: N/A Age: N/A Location: N/A Country: N/A Date: Around 1995 ``` Question: I heard that a computer has solved the famous four-color problem. I was wondering if someone could tell me why this is so. (The four-color problem is having to use four colors on a map so that no two colors that are the same are next to each other). I realize that for the two to be neighbors they must share infinitely many boundary points, but am still confused as to why this is true. Could someone tell me why you need four colors in either non mathematical or mathematical terms please. Replies: A few years ago two mathematicians at the University of Illinois created a proof that any map can be colored with four colors (or fewer). The proof is VERY long and is a challenge to understand. It proceeds by first reducing the infinitely many possible maps to a finite number of special cases (still a lot of cases) and then, wit assistance of a computer, checking all of these cases. There was an article describing the method of proof in the Scientific American a few years ago. That would be a good place to start in studying the proof. chaffer Click here to return to the Mathematics Archives

NEWTON is an electronic community for Science, Math, and Computer Science K-12 Educators, sponsored and operated by Argonne National Laboratory's Educational Programs, Andrew Skipor, Ph.D., Head of Educational Programs.

For assistance with NEWTON contact a System Operator (help@newton.dep.anl.gov), or at Argonne's Educational Programs

NEWTON AND ASK A SCIENTIST
Educational Programs
Building 360
9700 S. Cass Ave.
Argonne, Illinois
60439-4845, USA
Update: June 2012