Four-color conjecture and four-color theorem

1852 The "four-color conjecture" formed in the work of map dyeing has plagued mathematicians for many years. Rough looks, proving "four-color conjecture" does not seem difficult, but, to think up, the problem is not simple. Why?

For a long time, the use of traditional mathematical language (terminology and concepts) is unclear what the four-color conjecture problem belongs to what the branch of mathematics, in what language, even the problem itself is not clear, not to mention what "mathematical proof". To this, the wise mathematician also helpless, there is no way.

more than 100 years later,1976years6months,at the University of Illinois in the United States, two "Argel and Harken ( AppelandHaken )The use of two computers and different inspection procedures, continuous operation of more than 1000 hours (nearly two months), the direct inspection of more than 10 billion "man-made Maps" (to be tested map), found that no more than five colors to the map to color, thus drawing the inevitable "conclusion": Map coloring, four colors is enough. At first, mathematicians did not admit that the computer-based "spoof method" was a serious mathematical proof.

In fact, Argel and Harken use the computer to prove that four-color conjecture has opened up a new way for mathematical proof, also broadened people's horizons, so that the traditional mathematical proof method is no longer the only "orthodox".

into this century, 2005 expert in artificial intelligence Georges Gonthier using the French national mainframe computer to give the "four-color conjecture " fully checked formal proof " (full inspection of the formal proof), so far, four-color conjecture finally became a "four-color theorem." Alack!

Shimen 7 Month 2 Day

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Four-color conjecture and four-color theorem