Discrete mathematics is a comprehensive subject which integrates traditional logic, set theory (including function), number theory, algorithm design, combinatorial analysis, discrete probability, relation theory, graph theory and tree, abstract algebra (including algebraic system, group, ring, field, etc.). ), Boolean algebra, computational models (languages and automata) and so on. The application of discrete mathematics covers many fields of modern science and technology.
Discrete mathematics can also be said to be the basic core discipline of computer science. There is a famous typical example in discrete mathematics-the four-color theorem, also known as the four-color conjecture, which is one of the three major mathematical problems in the modern world. It was put forward by the British draftsman Fernandez guthrie in 1852. When he colored the map, he found a phenomenon, "Each map can only be colored in four colors, and *. So can this be proved mathematically? 100 years later 1976, Kenneth Appel and Wolfgang Haken used computer-aided calculation, which took 1200 hours and 1000 billion judgments, and finally proved the four-color theorem, causing a sensation in the world. This is discrete mathematics.
Discrete mathematics can be regarded as a bridge between mathematics and computer science, because discrete mathematics is not only inseparable from mathematical knowledge such as set theory and graph theory, but also related to database theory and data structure in computer science. It can lead people into the thinking field of computer science and promote the development of computer science.