Math 386: Combinatorics Announcements

Go to homework | course information | syllabus.

FINALS WEEK

No regular office hours; I will be around Tuesday late afternoon and Wednesday afternoon.
REVIEW SESSION

Date: Wed., 12/18

Time: 3:30-5:30 (THIS IS THE CORRECT TIME)

Room: LN-2205

Tests

Test I

On Thursday October 10, covering the parts we've done in Chapters 1, 3, and 5. Grading guidelines:

 	A       B       C       D       F
	77-100	57-76	37-56	28-36	0-27

Test II

On Thursday, November 7, covering Chapter 6 and Section 2.1. Grading guidelines:

	A       B       C       D       F
	83-100	72-82	61-71	54-60	0-53

Test III

On Thursday, December 5, covering the parts assigned in Sections 2.2, 2.3, 5.6, 7.1, 7.2, 7.4, 7.5. Grading guidelines:

	A       B       C       D       F
	89-100	74-88	57-73	47-56	0-46

Final Exam

On Thursday, December 19, at 8:30-10:30 a.m. in SL-206. I will allow an extra 15 minutes if possible. The exam will cover everything in the course, with some emphasis on the part since Test III (that is, on Homework XIV). Grading guidelines:

	A       B       C       D       F
	116-150	99-115	59-87	48-58	0-47

Corrections to Textbook

In the discussion of subsequences in Ch. 2, Application 9, the term "not decreasing" is the wrong technical term. A correct technical term for this property is "weakly increasing" or "nondecreasing" (both are used).

Ch. 2, #16. It should also be assumed that acquaintanceship is symmetrical: i.e., if A is acquainted with B, then B is acquainted with A. (This isn't always so in real life!)

Ch. 3, #9: The committee should consist of 5 (five) members.

Ch. 3, #16: ``no two rooks can attack one another.''

Sect. 5.7:

In Theorem 5.7.2, first paragraph of proof, the s's should be m's.
In properties 1 and 2 at the top of p. 152, each of the first two A's should be X. (The A⁺ and A^- and the last A are correct.)

In Section 6.3, p. 174, line 15, the expression (n-2)!D should be just (n-2)!.

In the answers to Ch. 6, the last 3 problem numbers are 1 greater than they should be.

In Ch. 10, page 341, the term ``GCD'' is introduced. It is an abbreviation for ``greatest common divisor,'' as mentioned in Theorem 10.1.2 on p. 343.

In Ch. 10, page 343, in the table at the top, the entries in Cols. A and B are sometimes interchanged from what the algorithm would give.

Go to homework | course information | syllabus.