四色定理的高中证明方法（High school proof method of four-color theorem）.docVIP

下载本文档

4
0
约 6页
2017-08-03 发布于河南
举报
版权申诉

四色定理的高中证明方法（High school proof method of four-color theorem）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

四色定理的高中证明方法（High school proof method of four-color theorem） Since twentieth Century, scientists have proved that the four color conjecture is basically in the light of Kemps idea. In 1913, Boekhoff introduced some new techniques on the basis of Kemp. In 1939, American mathematician Franklin proved that all maps under 22 countries could be painted in four colors. In 1950, it was promoted from 22 countries to 35 countries. In 1960, it was proved that maps under 39 countries could be painted in only four colors, and then moved to 50 countries. It seems that this push is still very slow. After the advent of electronic computers, because of the rapid increase in the speed of calculation, coupled with the emergence of human-computer dialogue, greatly accelerated the process of proof of the four color conjecture. In 1976, the J. Koch algorithm under the support of the American mathematician Appel (Kenneth Appel) and (Wolfgang Haken) in the United States at the University of Illinois in two different electronic computers, in 1200 hours, the 10 billion judge, finally completed the proof of the theorem. The computer conjecture of the four color conjecture caused a sensation in the world, when Chinese scientists were also studying the principle. It not only solves a difficult problem that lasted for more than 100 years, but also may become the starting point of a series of new thinking in the history of mathematics. The method of proving reduces the number of infinite possibilities on the map to 1936 states (later reduced to 1476), which are checked by the computer one by one. The work was re examined by separate procedures and by computer independently. In 1996, Neil, Robertson, Daniel, Sanders, Paul, Seymour, and Robin Thomas used a similar method of authentication that examined 633 specific cases. The new proof also uses computers, which are impractical if they are checked manually. The four-color theorem is the first computer proof theory that is not accepted by all mathem