MA 4133/6133 - Syllabus















MA 4133/6133, August 18, 2014

Meeting times and location:   MWF 1:00 - 1:50 pm,      Allen 20

Web page:

MA 4133/6133 covers discrete mathematics. The level of the course assumes basic background in modern algebra. We will begin with elementary counting problems, but quickly build to a solid exploration of combinatorics and some of its main techniques. Topics will include generating functions, inclusion-exclusion, and the combinatorics of the symmetric group. As time allows we will consider additional material.

The prerequisite is MA 3163; or equivalent mathematical maturity and experience.

My contact info:
     Dr. Russ Woodroofe
     Allen 418
     Office hours: WF 2:00 - 3:00pm,
     informally Th 9:30 - 11:00 am (in 929 Coffeehouse)
                     + by appt
     rwoodroofe at math,msstate,edu           

Miklós Bóna, A Walk Through Combinatorics, 3rd ed.
We will cover all of Section II (chapters 3-8), and selected topics from Section IV. (Material from Section III is covered in MA 4143, which is often offered in the Spring semester.) I will update the schedule periodically with a record of the topics covered.

There will be a homework assignment almost every week. You may collaborate with other students in the course if you wish. If you do collaborate substantially, then you should indicate this on your homework paper. Your write-up should in any case be entirely your own.
If you are taking the course as 6133, you will typically have one or more extra problems assigned. (You may also choose to work on these if you are taking the course as 4133.)

Your grade will be based on 2 in-class midterm exams and one final exam, together with weekly homeworks and possibly an occasional quiz, in the proportions
Midterm exams                     20% each
Final exam30%
Homework and quizzes30%

I have scheduled the midterm examinations for September 22nd and November 5th.
The final is scheduled by the University for December 11th, 3:00 - 6:00 pm.

If you are taking the course Pass/Fail, you need to do the equivalent of C work to pass.

Print-friendly version. (Opens in a new window.)