![]() |
![]() |
Your cart is empty |
||
Showing 1 - 2 of 2 matches in All Departments
This elegant little book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map such that no two adjoining countries have the same color, no matter how convoluted their boundaries. Many famous mathematicians have worked on the problem, but the proof eluded fomulation until the 1950s, when it was finally cracked with a brute-force approach using a computer. The book begins by discussing the history of the problem, and then goes into the mathematics, both pleasantly enough that anyone with an elementary knowledge of geometry can follow it, and still with enough rigor that a mathematician can also read it with pleasure. The authors discuss the mathematics as well as the philosophical debate that ensued when the proof was announced: Just what is a mathematical proof, if it takes a computer to provide one -- and is such a thing a proof at all?
This book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map so that no two adjoining countries have the same color? This problem remained unsolved until the 1950s, when it was finally cracked using a computer. This book discusses the history and mathematics of the problem, as well as the philosophical debate which ensued, regarding the validity of computer generated proofs.
|
![]() ![]() You may like...
Basic Financial Management
W.M. Conradie, C.M.W. Fourie, …
Paperback
Critical Dementia Studies - An…
Richard Ward, Linn J. Sandberg
Hardcover
R3,839
Discovery Miles 38 390
Sizzlers - The Hate Crime That Tore Sea…
Nicole Engelbrecht
Paperback
Wits University At 100 - From Excavation…
Wits Communications
Paperback
|