跳到内容
Four colors suffice : how the map problem was solved 预览资料
关闭预览资料
正在查...

Four colors suffice : how the map problem was solved

著者: Robin J Wilson
出版商: Princeton, NJ : Princeton University Press, 2002.
版本/格式:   图书 : 英语查看所有的版本和格式
数据库:WorldCat
提要:
"On October 23, 1852, Professor Augustus De Morgan wrote a letter to a colleague, unaware that he was launching one of the most famous mathematical conundrums in history - one that would confound thousands of puzzlers for more than a century. This is the amazing story of how the "map problem" was solved." "The problem posed in the letter came from a former student: What is the least possible number of colors needed  再读一些...
评估:

(尚未评估) 0 附有评论 - 争取成为第一个。

主题
更多类似这样的

 

在图书馆查找

&AllPage.SpinnerRetrieving; 正在查找有这资料的图书馆...

详细书目

类型/形式: History
[literature]
材料类型: 互联网资源
文件类型: 书, 互联网资源
所有的著者/提供者: Robin J Wilson
ISBN: 0691115338 9780691115337 0691120234 9780691120232
OCLC号码: 51730619
注意: Originally published 2002 by Penguin Group, London.
描述: xii, 262 p. : ill., maps, ports. ; 21 cm.
内容: The four-colour problem --
The problem is posed --
Euler's famous formula --
Cayley revives the problem ... --
... And Kempe solves it --
A chapter of accidents --
A bombshell from Durham --
Crossing the Atlantic --
A new dawn breaks --
Success! --
... but is it a proof?
其他题名: Four colours suffice
责任: Robin Wilson.
更多信息:

摘要:

On October 23, 1852, Professor Augustus De Morgan wrote a letter to a colleague, unaware that he was launching one of the most famous mathematical conundrums in history - one that would confound  再读一些...

评论

社评

出版商概要

"Wilson's lucid history weaves together lively anecdotes, biographical sketches, and a non-technical account of the mathematics."--Science "An attractive and well-written account of the solution of 再读一些...

 
用户提供的评论
正在获取GoodReads评论...
正在检索DOGObooks的评论

标签

争取是第一个!
确认申请

你可能已经申请过这份资料。如果还是想申请,请选确认。

链接数据


<http://www.worldcat.org/oclc/51730619>
library:oclcnum"51730619"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/51730619>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
rdf:typeschema:Intangible
schema:name"Problème des quatre couleurs."
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/1012120>
rdf:typeschema:Intangible
schema:name"Mathematical recreations"
schema:name"Mathematical recreations."
schema:about
schema:about
rdf:typeschema:Intangible
schema:name"Problème des quatre couleurs--Histoire."
schema:about
schema:about
rdf:typeschema:Intangible
schema:name"Problème des quatre couleurs--Histoire."
schema:about
rdf:typeschema:Intangible
schema:name"Couleur en cartographie."
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:author
schema:datePublished"2002"
schema:description"The four-colour problem -- The problem is posed -- Euler's famous formula -- Cayley revives the problem ... -- ... And Kempe solves it -- A chapter of accidents -- A bombshell from Durham -- Crossing the Atlantic -- A new dawn breaks -- Success! -- ... but is it a proof?"
schema:exampleOfWork<http://worldcat.org/entity/work/id/838126937>
schema:genre"History."
schema:genre"History"
schema:inLanguage"en"
schema:name"Four colors suffice : how the map problem was solved"
schema:numberOfPages"262"
schema:publisher
rdf:typeschema:Organization
schema:name"Princeton University Press"
schema:reviews
rdf:typeschema:Review
schema:itemReviewed<http://www.worldcat.org/oclc/51730619>
schema:reviewBody""On October 23, 1852, Professor Augustus De Morgan wrote a letter to a colleague, unaware that he was launching one of the most famous mathematical conundrums in history - one that would confound thousands of puzzlers for more than a century. This is the amazing story of how the "map problem" was solved." "The problem posed in the letter came from a former student: What is the least possible number of colors needed to fill in any map (real or invented) so that neighboring countries are always colored differently? This deceptively simple question was of minimal interest to cartographers, who saw little need to limit how many colors they used. But the problems set off a frenzy among professional mathematicians and amateur problem-solvers, among them Lewis Carroll, an astronomer, a botanist, an obsessive golfer, the Bishop of London, a man who set his watch only once a year, a California traffic cop, and a bridegroom who spent his honeymoon coloring maps. In their pursuit of the solution, mathematicians painted maps on doughnuts and horseshoes and played with patterned soccer balls and the great rhombicubotedron." "It would be more than one hundred years (and countless colored maps) later before the result was finally established. Even then, difficult questions remained, and the intricate solution - which involved no fewer than 1,200 hours of computer time - was greeted with as much dismay as enthusiasm." "Providing a clear and elegant explanation of the problem and the proof, Robin Wilson tells how a seemingly innocuous question baffled great minds and stimulated exciting mathematics with far-flung applications. This is the entertaining story of those who failed to prove, and those who ultimately did prove, that four colors do indeed suffice to color any map."--BOOK JACKET."
schema:workExample
schema:workExample
schema:workExample
schema:workExample

Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.