Introduction to combinatorial mathematics
Combinatorial mathematics, also known as discrete mathematics. Combinatorial mathematics in a broad sense is discrete mathematics, and combinatorial mathematics in a narrow sense is the general name of graph theory, algebraic structure, mathematical logic and so on. But this is only the difference between different scholars. In a word, combinatorial mathematics is a science that studies discrete objects. With the development of computer science, the importance of combinatorial mathematics is increasingly prominent, because the core content of computer science is to process discrete data with algorithms. 1 narrow sense combinatorial mathematics mainly studies the existence, counting and construction of configurations (also known as combinatorial models) that meet certain conditions. The main contents of combinatorial mathematics include combinatorial counting, combinatorial design, combinatorial matrix, combinatorial optimization (optimal combination) and so on.