Tsinghua University Online Course - Combinatorial Mathematics

Publish Date: Sep 22, 2016

Combinatorial Mathematics

Discover how to apply counting principles and combinatorics to solve problems in computer science, financial analysis, and your daily life.

About this course

Our lives are full of combinations. Combinatorial mathematics is just the science to deal with combinations of discrete items. As an ancient field, the history of combinatorial mathematics can be traced back over 4000 years to the age of the Great Yu in ancient China. Today, combinatorial mathematics is regarded as the basis of computer science since the algorithms in programming heavily rely on the analysis of the discrete elements.

Instead of relying on the traditional mathematical "theorem - proof" format, this course demonstrates various principles in an intuitive manner with ancient stories, the scenes of movies and even a magic show. What you’ll learn:

  • The counting principles based on the basic operations “+”, “-”, “*”, “/”; 
  • Generating functions
  • Recurrent number serials such as Fibonacci number, Catalan number, and more
  • Pigeon hole principles
  • Inclusion and exclusion principles
  • Polya counting based on group theory

This course is based on a highly regarded on-campus Tsinghua class called Combinatorics, and is ideal for students who are interested in mathematics or computer science. Enroll today and learn the mathematical theory needed to solve the real-world problems!

What you'll learn

  • Counting principles in our daily lives
  • Applying math to computer science and financial analysis
  • The science behind combinations of discrete items

Further Official Information

Link to Original

Similar Opportunities



Opportunity Types


Eligible Countries


Event Types