# Combinatorial Mathematics | 组合数学

Обучение бесплатное
Сертификация платная
10 месяцев
О курсе

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!

• 基于四则运算的计数法则；
• 母函数；
• 递推序列，如斐波那契数，卡特兰数等；
• 鸽巢原理；
• 容斥原理；
• 基于群论的波利亚定理。

FAQ

I don’t speak Chinese, can I learn the course?

All the materials are in English. Though the original video was recorded in Chinese, the course team record the corresponding dubbing in English. All the audio and subtitles are processed to fit the English dubbing as much as possible, so that you can enjoy this wonderful course in English.

What are the textbook and the reference books for this course?

There is no textbook requirement for this course. The handouts distributed every week are critical. The following books are references

• Richard A. Brualdi; Introductory Combinatorics (5th edition), Pearson, 2009
• J.H.van Lint and R.M. Wilson; A course in Combinatorics, Cambridge University Press, 2001
• 卢开澄,《组合数学》第四版,清华大学出版社

• 70% quizzes and exercises
• 30% final exam

How can I get the certificate?

If your final score is no less than 60.

Do I need to know how to program to learn this class?

Not necessary. This course is a math course which is based on fundamental theory. But to help the students to have the intuitive feel of the effects of the theory, we also provide a code lib that you can compare different implementations by running different programs.

Программа
Combinatorial Mathematics | 组合数学
Discover how to apply counting principles and combinatorics to solve problems in computer science, financial analysis, and your daily life. 本课程侧重介绍组合数学的概念和思想，研究离散对象的计数方法和相关理论。
Что Вы изучите?
• Counting principles in our daily lives
• Applying math to computer science and financial analysis
• The science behind combinations of discrete items
• 了解生活上的组合和数学的历史
• 深入学习计数的抽象理论和具体方法
• 深入理解组合数学对计算机理论发展的推动作用
Лекторы
Yuchun Ma
Associate Professor, Computer Science Tsinghua University

Yuchun Ma has received the Distinguished Teaching Award at Tsinghua and the First-prize award in Teaching competition at Beijing in 2013. She received her undergraduate degree in Computer Science from Xi’an Jiaotong University in 1999, and her Ph.D. in Computer Science from Tsinghua in 2004.

Платформа
Эта платформа предоставляет все курсы бесплатно. Авторами выступают топовые университеты и корпорации, которые стараются удерживать стандарты качества. За несоблюдение дедлайнов, невыполнение домашнего задания студенты теряют баллы. Как и в других платформах, лекционные видео чередуются с практическими заданиями. Обучение проводится на английском, китайском, испанском, французском и хинди.