Sec. 2: #1, 2, 3, 4, 5, 6, 9a

Sec. 3: #1, 2, 3, 4, 5, 6, 7

Sec. 4: #1, 4, 6, 8, 11, 13

Sec. 5: #2, 3, 6, 7, 8

Extra Credit:  Sec. 2 #9b

Sec. 6:  #1de, 8, 10a, 11def, 12ab, 14

Sec. 7:  #1, 4, 6, 7, 9, 10, 14

Sec. 8:  #1, 4, 5, 7

Sec. 10: #1cdghij, 4, 5cdef

Sec. 11: #1, 3, 5, 7, 12, 16b, 25a, 25c

Extra credit:  Sec. 11 #18

Sec. 13:  #1, 3, 6-9, 13ac

Sec. 14:  #1-3, 5, 8, 9

Sec. 15:  #1-4, 6, 9, 11-13

Sec. 16  #1, 2, 3, 7, 8, 27, 28

Sec. 18  #1, 3, 5

Sec. 19  #1, 3, 4, 5, 8, 11ab

Sec. 21  #1, 4b, 8a, 8b, 8c, plus

#17:  Prove by induction on n that for all natural numbers n,

2^0 + 2^ 1 + 2^2 + ... + 2^n = 2^(n+1) - 1

Sec. 46  #1, 2, 3, 6, 9, 10, 12, 16

Sec. 47  #1, 2, 3, 4, 5, 6, 8

Extra credit:  Prove or disprove:  There exists a graph G = (V, E) with |V| = 5 such that G has no 3-clique and the complement of G has no 3-clique.

Sec. 48 #1, 6, 8, 9

Sec. 49 #1, 6, 9, 17

Sec. 51 #1, 3, 4, 8, 13ab

Sec. 52 # 2

Sec. 23 # 1abdegh

Extra credit:  p.412 #7

• Sec 28 #1ade (use definition of big-O); 2abcdef (justify each answer); 3, 5, 6
• Sec 30 #5, 6b, 7, 9b, 12abc, 16, 17, 18, 20
• Sec 31 #1abcdef, 13, 14, 15, 16
• Sec 33 #2, 3, 4, 5, 9