Compared with the traditional mathematics course, combinatorial mathematics studies the mathematical relationship between discrete things, including existing problems, counting problems, construction problems and optimization problems, and its main content is counting and enumeration. Counting problem is the most studied content in combinatorics, which appears in all branches of mathematics. Computer science needs to study algorithms, and it needs to estimate the amount of computation and storage units needed by algorithms, that is, the analysis of time complexity and space complexity of algorithms. The research of combinatorial mathematics mainly includes the following contents [1- 3]: permutation and combination; Generating function and recurrence relation; Exclusion principle and pigeon nest principle; Burnside theorem and p? Lya theorem; Linear programming and so on

1 Combinatorial Mathematics in the information age Modern mathematics can be divided into two categories: one is the study of continuous objects, such as analysis and equations, and the other is the study of combinatorial mathematics of discrete objects. Computer science is the science of algorithm, the object of computer processing is discrete data, and the science of studying discrete objects is only combinatorial mathematics. Therefore, in the information age today, combinatorial mathematics is the mathematics of the information age. 3 12 Application of Combinatorial Mathematics in Computer Software With the development of computer science, combinatorial mathematics is also developing rapidly, and the theoretical progress of combinatorial mathematics has also promoted the development of computer science. Today, with the unprecedented development of computer software, the corresponding mathematical foundation is needed. Combinatorial mathematics, as the theoretical basis of most computer software design, goes without saying. Combinatorial mathematics is widely used in computers. Computer software is inseparable from the research of various algorithms. In order to measure the efficiency of an algorithm, it is necessary to estimate the number of steps (such as arithmetic operation, binary comparison, program call, etc.). ) to solve the given input (problem) with this algorithm. Therefore, it is necessary to estimate the amount of computation and the number of storage units required by the algorithm, which is the content of counting problem, and the main research content of combinatorial mathematical analysis is the methods and theories of counting and enumeration.