### MATH 327 - HOMEWORK PROBLEMS - Fall 2008

Homework 0 (due 8/28/08)
Exercises from the textbook
Chapter 0, p. 8-9: select two items per exercise that are not labeled BB from each of problems 1, 2, 3, 4, 5, 6, 7.

Homework 1 (due 9/2/08): Exercises from the textbook
Chapter 0, p. 8-9: problems from previous homework you did not hand on 8/28/08.
Chapter 0, p.15-17: 1(b), 2(b), 3(b)(d)(e), 7, 11, 19, 29.

Homework 2 (due 9/11/08): Exercises from the textbook
Section 1.1, p. 23: 6, 10 (a tautology is a compound statement that is always true, a contradiction is a compound statement that is always false).
Section 2.1, p.42-43: 1(d), 5(b)(c)(f), 12(b)(f), 14(b).

Homework 3 (due 9/23/08): Exercises from the textbook
Section 2.2, p.49-51: 6(b), 10(d)-11(d), 12(c)(d)(f)(g), 27(b)(d)
Section 2.3, p.56-57: 3(b)(e), 5(c)(h), 8(b), 9(g).
Section 2.4, p.63: 1(a), 2(b)(c) (recall that an equivalence relation is one that is reflexive, symmetric and transitive).

Homework 4 (due 10/14/08): Read Sections 2.5 (order relations), and 3.1 (functions, one-to-one, onto, bijections)
Section 2.5 (p. 69): 5, 6, 10, p.71 (review exercises) 22.
Section 3.1 (p. 78-80): 1(b)(d)(e), 4(b)(c)(d), 10, 16, 26, 27, 34.

Homework 5 (due 10/21/08): Read Sections 3.2 and 3.3 (inverses, compositions, cardinality)
Section 3.2 (p. 86-87): 5, 8, 18, 19(b)(c), 24.
Section 3.3 (p. 95): 7, 9, 11(a), 12(b), 18, 21.

Homework 6 (due 11/06/08): Read Sections 4.1 and 4.2 (division algorithm and euclidean algorithm)
Section 4.1 (p. 104-105): 7[BB], 9, 12(a)(b), 11(c).
Section 4.2 (p. 112-113): 7, 10(b)(d), 12(d), 16, 18, 19, 34.

Homework 7 (due 11/13/08): Read Sections 4.3 (prime numbers) and Section 5.1 (mathematical induction)
Section 4.3 (p. 123-125): do 6(c), 7, 9, 10(b), 17, 35 or do instead 36, 37.
Section 5.1 (p. 156-159): 4(d)(i), 5(b), 6(e), 8(c), 9(e), 15, 19, 25.

Midterm 2 - Take home, due on November 25, 2008.

Homework 8 (due 12/11/08): Read Chapters 6 and 7: Sec 6.1 (inclusion-exclusion principle), Sec 6.2 (addition and multiplication principles), Sec 7.1 (permutations), 7.2 (combinations), 7.5 (repetitions), 7.7 (binomial theorem). Choose at least one problem per section to turn in:
Section 6.1 (p. 190-192): 6, 11(b).
Section 6.2 (p. 198-199): 4, 8, 24*, 26*.
Section 7.1 (p. 209-210): 10, 11.
Section 7.2 (p. 214-216): 9, 16, 19*, 26*.
Section 7.5 (p. 235-236): 12, 14(d).
Section 7.7 (p. 244-245): 12, 13.