Loading page · 正在加载页面
Loading page · 正在加载页面
Tsinghua University · 60240013X
组合数学
A Tsinghua computer-science theory course on counting principles, permutations and combinations, generating functions, recurrence relations, Catalan and Stirling numbers, inclusion-exclusion, pigeonhole and Ramsey ideas, groups, Burnside's lemma, and Pólya enumeration.
Subject：Discrete Mathematics
Level：Advanced Undergraduate
Suggested stage：Years 3–4 (inferred)
Public-material edition：Official course page (year not stated)
Language：Chinese
Videos：Available
Assignments / solutions：Available / Not verified
Start here
Lectures, video, assignments and exams are separated so you do not have to hunt through the course homepage.
Use these to browse a complete resource collection; the section above links directly to individual study items.
Every link points to an official university or course-team page. The year identifies the linked public-material edition, not necessarily the latest on-campus offering; a school may have newer materials that are not public. Unknown facts remain unverified rather than guessed.
Tsinghua University course on XuetangX · verified 2026-08-22