Discrete mathematics is a mathematical discipline that studies the structure and relationship of discrete quantities and an important branch of modern mathematics. It is widely used in various disciplines, especially in computer science and technology. At the same time, discrete mathematics is also an essential compulsory course for many professional courses of computer specialty. 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 requirement of learning discrete mathematics is very low, as long as you have knowledge of elementary mathematics, you can learn it. Of course, it would be better if you had studied advanced mathematics. There are many discrete mathematics textbooks, and now the main ones are: [1] Geng Suyun and Qu Wanling. Discrete mathematics (the tenth five-year textbook). Higher Education Press, 2004.

[2] Yuan Chongyi, Qu Wanling, Wang Hanpin, Liu Tian. Discrete mathematics and its application (4th edition, translation). Machinery Industry Press, 2002.

[3] Lu Zhongwan. Mathematical logic in computer science. Science Press, 2002.

[4] Geng Suyun, Qu Wanling, Wang Hanpin. Course of Discrete Mathematics, Peking University Publishing House, 2002.

[5] Geng Suyun. Discrete Mathematics Exercise Set-Mathematical Logic and Set Theory Volume. Peking University Publishing House, 1993.

[6] Sean. Discrete mathematics exercises-abstract algebra volume. Peking University Publishing House, 1990.

[7] Geng Suyun. Discrete mathematics problem sets-graph theory volume. Peking University Publishing House, 1990.

[8] Hamilton, translated by Zhu Shuilin. Mathematical logic. East China Normal University Press, 1987.