- 在线播放
- 分集下载
- 00. Professor Bio
- 01. What Is Discrete Mathematics
- 02. Basic Concepts of Combinatorics
- 03. The 12-Fold Way of Combinatorics
- 04. Pascal's Triangle and the Binomial Theorem
- 05. Advanced Combinatorics—Multichoosing
- 06. The Principle of Inclusion-Exclusion
- 07. Proofs—Inductive, Geometric, Combinatorial
- 08. Linear Recurrences and Fibonacci Numbers
- 09. Gateway to Number Theory—Divisibility
- 10. The Structure of Numbers
- 11. Two Principles—Pigeonholes and Parity
- 12. Modular Arithmetic—The Math of Remainders
- 13. Enormous Exponents and Card Shuffling
- 14. Fermat's ''Little'' Theorem and Prime Testing
- 15. Open Secrets—Public Key Cryptography
- 16. The Birth of Graph Theory
- 17. Ways to Walk—Matrices and Markov Chains
- 18. Social Networks and Stable Marriages
- 19. Tournaments and King Chickens
- 20. Weighted Graphs and Minimum Spanning Trees
- 21. Planarity—When Can a Graph Be Untangled
- 22. Coloring Graphs and Maps
- 23. Shortest Paths and Algorithm Complexity
- 24. The Magic of Discrete Mathematics
离散数学（英文版）的相关介绍
就第一集做了字幕,其他的不考虑做了. 简介:Arthur T. Benjamin这个老师语言清晰,思路清楚,讲解生动形象.学起来也不费时间.他还在TED上表演过数学魔术呢,感兴趣的移步:http://www.ted.com/talks/arthur_benjamin_does_mathemagic.此专辑主要针对大一大二的同学吧.作者个人网站:https://www.math.hmc.edu/~benjamin/
教程列表：
00. Professor Bio
01. What Is Discrete Mathematics
02. Basic Concepts of Combinatorics
03. The 12-Fold Way of Combinatorics
04. Pascal's Triangle and the Binomial Theorem
05. Advanced Combinatorics—Multichoosing
06. The Principle of Inclusion-Exclusion
07. Proofs—Inductive, Geometric, Combinatorial
08. Linear Recurrences and Fibonacci Numbers
09. Gateway to Number Theory—Divisibility
10. The Structure of Numbers
11. Two Principles—Pigeonholes and Parity
12. Modular Arithmetic—The Math of Remainders
13. Enormous Exponents and Card Shuffling
14. Fermat's ''Little'' Theorem and Prime Testing
15. Open Secrets—Public Key Cryptography
16. The Birth of Graph Theory
17. Ways to Walk—Matrices and Markov Chains
18. Social Networks and Stable Marriages
19. Tournaments and King Chickens
20. Weighted Graphs and Minimum Spanning Trees
21. Planarity—When Can a Graph Be Untangled
22. Coloring Graphs and Maps
23. Shortest Paths and Algorithm Complexity
24. The Magic of Discrete Mathematics