Wolfram ResearchProductsPurchasingServices & ResourcesAbout UsOur Sites
Wolfram Mathematical Explorer Products
-----
 /
Mathematical Explorer
*What Is Mathematical Explorer?
*Topics from Mathematical Explorer
*Prime Numbers
*Calculus
*Computing Pi
*Square Wheels
*Check Digits
*Secret Codes
*Puzzles
*Exploring Escher Patterns
*Roses
*Turtle Fractalization
*Patterns in Chaos
*Fermat's Last Theorem
*The Riemann Hypothesis
*Unusual Number Systems
<The Four-Color Theorem
*Reviews of Mathematical Explorer
*For More Information
*Buy Online
*Ask about this page
*Print this page
*Email this page
*Give us feedback
*
Sign up for our newsletter:
Previous
The Four-Color Theorem--Can 
Computers Prove Theorems?

In 1976, Kenneth Appel and Wolfgang Haken, two mathematicians at the University of Illinois, announced to the world that they had found a proof of the famous Four-Color Problem: can every map be colored with four colors so that adjacent countries are assigned different colors? Having a solution to this simply stated problem, which had stumped the mathematical community for one hundred years, was news enough. But the really shocking aspect of the announcement was that the mathematicians had used a computer to do the really hard parts. In fact, their proof could not even be checked without a computer! Needless to say, this was fundamentally troubling to many in the mathematical community. As Ron Graham, a mathematician at Bell Labs, wondered, "The real question is this: If no human being can ever hope to check a proof, is it really a proof?"





 © 2008 Wolfram Research, Inc.  Terms of Use  Privacy Policy