The Art of Counting's Full Profile
This undergraduate subject on "The Art of Counting" features a comprehensive set of 233problems for students to solve.The course is structured with one lecturesession per week, and student presentations to report on their workin oneproblemsession per week.The subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2n-1. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (one-to-one correspondence) between them. This is a subject which requires little mathematical background to reach the frontiers of current research. Students will therefore have the opportunity to do original research. It might be necessary to limit enrollment.
Feb 01, 2003
to May 25, 2003
Days of the Week:
Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
- Level of Difficulty: Beginner
- Size: Massive Open Online Course
- Instructor: Prof. Richard Stanley
- Cost: Free
- Institution: MIT OCW
- Topics: General Art
About MIT OCW:
MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.
MIT OCW Offers Courses In:
Questions about The Art of Counting
Want more info about The Art of Counting?
Get free advice from education experts and Noodle community members.
MIT OpenCourseWare (MIT OCW) is an initiative of the Massachusetts Institute of Technology (MIT) to put all of the educational materials from its undergraduate- and graduate-level courses online, partly free and openly available to anyone, anywhere.