Homework for Math 104: Finite Mathematics

Fall 2002

Due on Assignment
Wednesday, September 4 Section 5.1: 5-8, 13-20, 41-46, 48-51
5.2: 1, 3, 5, 7, 8, 12, 13, 17, 22, 34-36, 42, 44, 45, 46, 48, 51, and the following: [Due to the limits of ASCII characters, I am using U for union and & for intersection.]
(a) Simplify (E & F) U (E & F').
(b) Simplify (E & F) & (E & F').
(those two may be easier using Venn diagrams)
(c) Suppose n(E) = 12 and n(E & F) = 5. What is n(E & F')?
Wednesday, September 11 Section 5.3: 1-9 odd, 22-26, 49-52
5.4: 1-4, 11, 12, 20, 23, 26, 32, 36; supp. ex (p. 247) 42-44
5.5: 4, 6, 18, 19, 21, 22, 26, 28-30, 43, 47-50, 52, 57, 69, 72
Wednesday, September 18 Section 5.6: 2, 3, 9, 10, 12, 15, 28, 29, 31-34
Section 5.7: 4, 6, 8, 11-16, 30, 33, 34, 39, 40, 42
Wednesday, September 25 Section 6.2: 1-3, 8, 9, 11, 14-16, and the following:
Let E= {a, e, i, o, u} and F={s, e, q, u, o, i, a} with U the alphabet.
  1. Are E and F mutually exclusive?
  2. Suppose a letter of the alphabet is chosen at random and found to be in the set E (i.e. suppose E occurs). Can you say anything about F's occurance? If so, what? If not, why not?
  3. Suppose F occurs. Can you say anything about E's occurrence? If so, what? If not, why not?
Wednesday, October 2 6.3: 2, 3, 5-8, 16-18, 20
6.4: 2-5, 16, 19, 26, 27, 30, 38
6.5: 1-4, 11, 12, 15, 16, 17, 18, 21, 22, 25, 48
Wednesday, October 9 6.6: 1, 3, 5, 10, 16, 17, 24, 25
7.1: 1, 2, 5, 6, 7, 8, 14, 15, 18, 21, 24

Wednesday, October 16 7.2: 2, 3, 5, 11, 12, 28
7.4: 2, 4, 6, 9, 10, 14, 15, 18, 24 [For #10, note that "slugs" are fake silver dollars and the winnings are any real silver dollars drawn.]
Wednesday, October 30 7.5: 1-6
7.5: 12, 15, 16
Wednesday, November 6 7.6: 1-29 odd
1.1: 19, 22-24, 32
1.2: 15, 16, 22, 27, 29, 32, 35, 41
1.3: 1, 2, 9, 10, 17, 18 (on #18, see practice problem)
Wednesday, November 13 3.1: 1-6
3.2: 1-4, 13-16
3.3: 1-2, 20-26
Wednesday, November 20 2.3: 1-4, 8-12, 21-26, 33-36, 44
Wednesday, November 27 9.1: 1-4, 9-13, handout
Note: On the handout, on question #4 ignore my biggoted mention of "the Gaussian method" and solve the system however you please.
Wednesday, December 4 9.2, handout
Wednesday, December 11 9.3: 1-4, 7-8, 11-12