Policies

Homework will usually be assigned on Thursday and will be due by the end of class the following Thursday. No late homework will be accepted. The two lowest homework scores will be dropped. Homework must be stapled and clearly labelled with your name. Students are encouraged to collaborate on homework assignements. Collaboration means working together to frame problems, devise approaches, and compare results. The final work, however, must be the work of the individual student, indicating that you alone prepared the work and understand the material. This means you must write up solutions independently.

Corrections

If you believe there is a mistake on any grading, you have two weeks from when the item is handed back to bring it to my attention.
Number Due Problems Solutions
9 Dec 6th Section 14.3, Problems 9, 12, 20
Section 17.1, Problems 4, 10
Section 17.2, Problems 10, 12
Solutions
8 Nov 29th Section 11.5, Problems 2, 4, 14
Section 11.6, Problems 4, 8, 18
Solutions
Nov 15th Midterm; no homework due. Solutions
7 Nov 8th Section 11.4, Problems 10, 14, 16, 20 Solutions
6 Nov 1st Section 11.2, Problems 2b, 4, 6, 14
Section 11.3, Problems 6, 16, 20, 30
Solutions
5 Oct 25th Section 10.3, Problems 2, 6, 8, 10
Section 11.1, Problems 6, 7, 8, 10
Solutions
4 Oct 18th Section 9.1, Problem 2
Section 9.2, Problems 16, 30
Section 10.1, Problems 4, 10
Section 10.2, Problems 4, 12, 24
Solutions
Oct 4th Midterm; no homework due. Solutions
3 Sep 27 Section 1.5, Problem 11
Section 4.1, Problems 2, 14, 18
Section 8.1, Problems 4, 8, 10, 20
Solutions
2 Sep 20 Section 1.3, Problems 12, 16, 17ab
Section 1.4, Problems 2, 10, 28
ia) 10 chores need to be allocated among 4 people. How many ways are there to do this?
ib) What if the chores need to be allocated relatively fairly, so each person does either 2 or 3 of the chores?
ii) A group of n people are hanging out, and some of them may decide to go to bed early. It is possible for all of them to go to bed early, or none of them, or any number in between. By counting this two different ways, show that
is equal to 2n.
Text of problems
Solutions
1 Sep 13 Section 1.2, Problems 2, 4, 10, 14
i) 4 people bring gifts to a party to exchange. How many ways are there to distribute the gifts so no person receives the gift they brought and everyone gets a gift?
Text of problems
Solutions