Blog Search
Archive
Blog Statistics
  • Views: 3324992
  • Articles: 1346
  • Comments: 1030
  • Status: Public
  • Who's Viewing: 0
Posted by bio_man   November 23, 2021   5031 views

The Four Color Theorem is a famous mathematical theorem that states that no more than four colors are required to color the regions of any map so that no two adjacent regions have the same color. Adjacent means that two regions share a common boundary curve segment, not merely a corner where three or more regions meet. Unlike other proofs before its discovery, computers were used to resolve this long-standing mathematical conjecture that was first proposed in 1850 by Francis Guthrie. After more than a century later, mathematicians, Kenneth Appel and Wolfgang Haken, finally derived its proof in 1976, and determined that it is practicality impossible for humans to verify it without the use of a computer. According to the four color theorem, any planner map or graph is possible to be colored only with the four colors (as shown above).

mathematics history proofs logic maps
Posted in Uncategorized
You might also like...
No Comments | Write Comment
RSS Feed   RSS Articles Feed   RSS Comments Feed
More Syndication Links