Combinatorial Mathematics | 组合数学
- Discover how to apply counting principles and combinatorics to solve problems in computer science, financial analysis, and your daily life. ... mehr...Discover how to apply counting principles and combinatorics to solve problems in computer science, financial analysis, and your daily life. æ¬è¯¾ç¨ä¾§éä»ç»ç»åæ°å¦çæ¦å¿µåææ³ï¼ç ç©¶ç¦»æ£å¯¹è±¡çè®¡æ°æ¹æ³åç¸å ³çè®ºã weniger
Hier kannst du der Eggheads Community deine Fragen zu diesem Kurs stellen. Auch Kursleiter können mitdiskutieren.
Du must angemeldet sein um zu antworten
- 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! æä»¬çæ´»çæ¹æ¹é¢é¢é½å æ»¡çç»åï¼èç»åæ°å¦æ£æ¯ç ç©¶ç¦»æ£äºç©çå¦ç§ãä½ä¸ºä¸ä¸ªå ·ææ ä¹ åå²çå¦ç§ï¼ç»åæ°å¦çåå±å¯ä»¥è¿½æº¯å°4000å¹´åçå¤§ç¦¹æ¶ä»£ãèå¦ä»ç»åæ°å¦éçè®¡ç®æºå¦ç§çåå±å¼å¯äºæ°çç¯ç« ï¼ç±äºç¨åºç®æ³çåæåå®ç°æ£æ¯åºäºå¯¹ç¦»æ£å¯¹è±¡çåæï¼å æ¤ç»åæ°å¦å·²ç»åå±æä¸ºè®¡ç®æºå¦ç§çåºç¡çè®ºã èæ¬è¯¾ç¨ä¸æ¹ä»¥å¾æ°å¦æå¦çâå®ç-è¯æâæ¨¡å¼ï¼å¼é¢å¤§å®¶ç±æµ å ¥æ·±å°éæ¥æ¢ç´¢ç¥è¯çæºæ³ï¼è¿éæå¤ä»£æ äºï¼æçµå½±çæ®µï¼çè³ç¨éæ¯æ¥æ¼ç»æ°å¦æ¦å¿µãèè¿äºå½¢å¼å°±æ¯ä¸ºäºå¼é¢å¤§å®¶å»æåæ°å¦çç¾ãå ·ä½çæå¦å å®¹å æ¬ï¼ åºäºååè¿ç®çè®¡æ°æ³åï¼ æ¯å½æ°ï¼ éæ¨åºåï¼å¦ææ³¢é£å¥æ°ï¼å¡ç¹å °æ°çï¼ é¸½å·¢åçï¼ å®¹æ¥åçï¼ åºäºç¾¤è®ºçæ³¢å©äºå®çã æ¬è¯¾ç¨çå å®¹åå¤§çº²ä¸»è¦åºäºæ¸ åå¤§å¦ç²¾åè¯¾ãç»åæ°å¦ãï¼éè¿æ¬è¯¾ç¨çå¦ä¹ ï¼å¦ä¹ è å¯ä»¥æ·±å ¥äºè§£è®¡æ°çæ½è±¡çè®ºåå ·ä½æ¹æ³ï¼ä»èæ·±å ¥çè§£ç»åæ°å¦å¯¹è®¡ç®æºçè®ºåå±çæ¨å¨ä½ç¨ãã 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 å¢å¼æ¾,ãç»åæ°å¦ãç¬¬åç,æ¸ åå¤§å¦åºçç¤¾ What is the grading breakdown? 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.
- USD 49