Please write out solutions to the following exercises from Rosen’s Discrete Mathematics & Its Applications, 8th edition:

HW #4 (due date TBA):

  • Section 3.1 (Algorithms): #3-8, 23, 24, 38, 39, 42 (extra credit: 43, 44)
  • Section 3.2 (Growth of Functions): #5, 23, 25, 35, 36, 37 [for #5 & 23: include graphs showing the relationship between the relevant functions]
  • Section 3.3 (Complexity of Algorithms): #1-4

HW #3 (due Monday April 4):

  • Section 1.7 (Proofs): #1, 6, 10, 19(a), 20(a)
  • Section 2.1 (Sets): #1, 8, 29
  • Section 2.2 (Set Operations): #3, 4, 15(a), 16(a), 22(a), 38, 40 [extra credit: #53, 54]
  • Section 2.3 (Functions): #7, 9-12 (for #10 & #12, if given function is not one-to-one, show why!), 30, 44 (hint: think in terms of graph of y = x^2)

HW #2 (due Monday March 7):

  • Section 1.4 (Predicates & Quantifiers): #2, 6, 8, 10, 12, 18(a)-(d), 30
  • Section 1.5 (Nested Quantifiers): #4(a)-(d), 10(a)-(d)
  • Section 1.6 (Rules of Inference): #5, 6

HW #1 (due Monday Feb 14):

  • Section 1.1 (Propositional Logic): #12(a)-(d), 16(a)-(d), 32, 34(a)(b)(d), 39(a)
  • Section 1.2 (Applications of Propositional Logic): #44, 45, 46
  • Section 1.3: #6, 8, 11(a), 12(d), 20 (construct the truth tables and show they are identical!)