Discover how the math knowledge could be applied in many areas such as computer science, and financial analysis.
About the course:
Combinatorial mathematics is just the science to deal with combinations of discrete items. As an ancient field, the history of combinatorial mathematics could be traced back over 4000 years to the age of the Great Yu in ancient China. Nowadays, it is regarded as the fundamental knowledge of computer science since the algorithms in programming heavily rely on the analysis of the discrete elements.
Specific topics covered include:
- The counting principles based on the basic operations "+", "-", "*", "/";
- Generating functions;
- Recurrent number serials such as Fibonacci number, Catalan number etc;
- Pigeon hole principles;
- Inclusion and exclusion principles;
- Polya counting based on group theory.
Duration: 10 weeks
Timings: 4 to 6 hours / week.
To apply, click here.