• Study Resource
  • Explore
    • Arts & Humanities
    • Business
    • Engineering & Technology
    • Foreign Language
    • History
    • Math
    • Science
    • Social Science

    Top subcategories

    • Advanced Math
    • Algebra
    • Basic Math
    • Calculus
    • Geometry
    • Linear Algebra
    • Pre-Algebra
    • Pre-Calculus
    • Statistics And Probability
    • Trigonometry
    • other →

    Top subcategories

    • Astronomy
    • Astrophysics
    • Biology
    • Chemistry
    • Earth Science
    • Environmental Science
    • Health Science
    • Physics
    • other →

    Top subcategories

    • Anthropology
    • Law
    • Political Science
    • Psychology
    • Sociology
    • other →

    Top subcategories

    • Accounting
    • Economics
    • Finance
    • Management
    • other →

    Top subcategories

    • Aerospace Engineering
    • Bioengineering
    • Chemical Engineering
    • Civil Engineering
    • Computer Science
    • Electrical Engineering
    • Industrial Engineering
    • Mechanical Engineering
    • Web Design
    • other →

    Top subcategories

    • Architecture
    • Communications
    • English
    • Gender Studies
    • Music
    • Performing Arts
    • Philosophy
    • Religious Studies
    • Writing
    • other →

    Top subcategories

    • Ancient History
    • European History
    • US History
    • World History
    • other →

    Top subcategories

    • Croatian
    • Czech
    • Finnish
    • Greek
    • Hindi
    • Japanese
    • Korean
    • Persian
    • Swedish
    • Turkish
    • other →
 
Profile Documents Logout
Upload
Here - Ohio University
Here - Ohio University

Core entropy and biaccessibility of quadratic polynomials
Core entropy and biaccessibility of quadratic polynomials

Ways to Prove that Quadrilaterals are Parallelograms
Ways to Prove that Quadrilaterals are Parallelograms

Introduction to analytic number theory
Introduction to analytic number theory

A Transition to Advanced Mathematics
A Transition to Advanced Mathematics

Geo Final Review 2014
Geo Final Review 2014

Plane Geometry - UVa-Wise
Plane Geometry - UVa-Wise

Large convex holes in random point sets
Large convex holes in random point sets

Version 1.0 of the Math 135 course notes - CEMC
Version 1.0 of the Math 135 course notes - CEMC

... Showing Two Sets Are Equal . . . . . . . . . . . . . 8.3.1 Converse of an Implication . . . . . . . . . . . 8.3.2 If and Only If Statements . . . . . . . . . . . 8.3.3 Set Equality and If and Only If Statements . ...
Heesch`s Tiling Problem
Heesch`s Tiling Problem

Amazing properties of binomial coefficients
Amazing properties of binomial coefficients

Trisectors like Bisectors with equilaterals instead of Points
Trisectors like Bisectors with equilaterals instead of Points

... and they could find it. But curiously they did not and it was overlooked during the following two thousand years. Angle trisectors exist regardless of how they can be constructed. If the structure of angle trisectors maintains the regularity which characterizes the triangle geometry then theorems mu ...
numbers and uniform ergodic theorems
numbers and uniform ergodic theorems

Chapter 4 Worksheet
Chapter 4 Worksheet

LANDAU`S PROBLEMS ON PRIMES 1. Introduction In his invited
LANDAU`S PROBLEMS ON PRIMES 1. Introduction In his invited

Simultaneous Approximation and Algebraic Independence
Simultaneous Approximation and Algebraic Independence

Non-Euclidean Geometry and a Little on How We Got Here
Non-Euclidean Geometry and a Little on How We Got Here

... Egyptian and Mesopotamian values of 8 = 3.125 and 10 = 3.162 have been traced to much earlier dates. Now in defense of Solomon’s craftsmen it should be noted that the item being described seems to have been a very large brass casting, where a high degree of geometrical precision is neither possible ...
Using Congruence Theorems
Using Congruence Theorems

Hon Geometry Midterm Review
Hon Geometry Midterm Review

Euclid`s Elements: Introduction to “Proofs”
Euclid`s Elements: Introduction to “Proofs”

Applying Triangle Sum Properties
Applying Triangle Sum Properties

Art`s Geometry Notes
Art`s Geometry Notes

Postulates Theorems and Corollaries
Postulates Theorems and Corollaries

HS Geometry West Campus Pacing Topic 4 2016-17
HS Geometry West Campus Pacing Topic 4 2016-17

Full text
Full text

< 1 2 3 4 5 6 7 8 9 ... 153 >

Four color theorem



In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color. Two regions are called adjacent if they share a common boundary that is not a corner, where corners are the points shared by three or more regions. For example, in the map of the United States of America, Utah and Arizona are adjacent, but Utah and New Mexico, which only share a point that also belongs to Arizona and Colorado, are not.Despite the motivation from coloring political maps of countries, the theorem is not of particular interest to mapmakers. According to an article by the math historian Kenneth May (Wilson 2014, 2), “Maps utilizing only four colors are rare, and those that do usually require only three. Books on cartography and the history of mapmaking do not mention the four-color property.”Three colors are adequate for simpler maps, but an additional fourth color is required for some maps, such as a map in which one region is surrounded by an odd number of other regions that touch each other in a cycle. The five color theorem, which has a short elementary proof, states that five colors suffice to color a map and was proven in the late 19th century (Heawood 1890); however, proving that four colors suffice turned out to be significantly harder. A number of false proofs and false counterexamples have appeared since the first statement of the four color theorem in 1852.The four color theorem was proven in 1976 by Kenneth Appel and Wolfgang Haken. It was the first major theorem to be proved using a computer. Appel and Haken's approach started by showing that there is a particular set of 1,936 maps, each of which cannot be part of a smallest-sized counterexample to the four color theorem. (If they did appear, you could make a smaller counter-example.) Appel and Haken used a special-purpose computer program to confirm that each of these maps had this property. Additionally, any map that could potentially be a counterexample must have a portion that looks like one of these 1,936 maps. Showing this required hundreds of pages of hand analysis. Appel and Haken concluded that no smallest counterexamples exist because any must contain, yet do not contain, one of these 1,936 maps. This contradiction means there are no counterexamples at all and that the theorem is therefore true. Initially, their proof was not accepted by all mathematicians because the computer-assisted proof was infeasible for a human to check by hand (Swart 1980). Since then the proof has gained wider acceptance, although doubts remain (Wilson 2014, 216–222).To dispel remaining doubt about the Appel–Haken proof, a simpler proof using the same ideas and still relying on computers was published in 1997 by Robertson, Sanders, Seymour, and Thomas. Additionally in 2005, the theorem was proven by Georges Gonthier with general purpose theorem proving software.
  • studyres.com © 2025
  • DMCA
  • Privacy
  • Terms
  • Report