I am usually available for questions MWF before and after class, and at 4pm; but I need to know in advance if you'd like to meet with me. Professor Tollisen is also available MTThF, 2-5pm (12 hours per week!) in Library 17.
Final Exam R 5/11, 1pm. The final exam will cover all homework assignments. I may also ask you to give definitions.
For M 5/1: Review all problems in HWs 24-28 and bring questions to class.
For F 4/28: Review all problems in HWs 18-23 and bring questions to class.
For W 4/26: Review all problems in HWs 11-17 and bring questions to class.
For M 4/24: Review all problems in HWs 1-10 and bring questions to class.
HW 28, due F 4/21. Read Examples 1, 2, and 3 of Sec 7.4. Do Sec 7.4: 1, 3, 4, 6, 7, 10-13.
HW 27, due W 4/19. Read Sec 7.1. Do Sec 7.1: 7, 13, 21, 23, 27a, 31, 35, 38.
HW 26, due F 4/14 M 4/17: Read Sec 6.4 p.415-416. Do Sec 6.4: 1b, 5, 9, 14. Also do Sec 5.1: 57, 59, 60, 64 (hint for #64: use Lemma 2 of Sec 4.3).
HW 25, due W 4/12: Read Sec 5.3 p.344-347 (may skip Theorem 1). Do Sec 5.3: 1, 5,7-9, 12, 13.
HW 24, due M 4/10: Read Sec 9.5 p.612-614. Do Sec 9.5: 41, 45abd, 47ad, 55, 57, 65.
HW 23, due F 4/7: Read Sec 9.5 up to and including Example 10. Do Sec 9.5: 1, 3, 15, 17, 26, 35-37.
HW 22, due W 4/5: Read Sec 9.1 p. 573-578; may ignore the term "antisymmetric". Do Sec 9.1: 1e, 3cd, 7 (ignore antisymmetric), 9, 27a, 35a-f, 47, 49, 50ab, 53.
HW 21, due M 4/3: Read Sec 6.3. Do Sec 6.3: 3, 11, 13, 17, 19, 23, 31.
Midterm 2, F 3/31. The exam will cover HWs 12-20. The best way to review for the exam is to redo all homework problems, especially those that you couldn't do on your own and had to get help (or look at the solutions) for them. Make sure you can do the problems without looking at your notes or the book.
HW 20, due M 3/27: Read Sec 6.2 p.399-402. Do Sec 6.2: 3, 7, 31, 33, 35, 46.
HW 19, due F 3/24: Read Sec 6.1; you don't have to read all of it, just as much as you feel you need to be able to do the homework problems. Do Sec 6.1: 15, 23, 25, 27, 29, 35, 36, 41.
HW 18, due W 3/22: Read Sec 5.2 p.333-337. Do Sec 5.2: 12. Also do Sec 5.1: 10, 35.
HW 17, due M 3/20: Read "some" of Sec 5.1 p.311-324. By "some" I mean you don't need to read all. I recommend that instead of reading all of it, you read just a few examples, but very slowly and thoughtfully. If you really understand the concept of induction, I don't think you need to read much; just do problems. If you don't fully understand induction, just reading a lot of examples might not help much; it might be better to discuss it with me or someone else. Do Sec 5.1: 5, 6, 23, 33, 43, 49.
HW 16, due F 3/17: Read Sec 4.3 Theorem 3 and its proof, and p.267-268, and p.271-272. Do Sec 4.3: 11, 31, 49, 50, 55. Also: Prove that if k | mn and k divides neither m nor n, then gcd(k,m) > 1 and gcd(k,n) > 1. Hint: See Lemma 2 of Sec 4.3. Hint for #50: gcd(b,m) = gcd(a + (b-a), m).
HW 15, due W 3/15: Read Sec 4.3 p.257-258, p.265-266, and Theorem 5. Do Sec 4.3: 3a, 5, 12, 15, 17ab, 21, 22, 25af, 27af, 33ce. Also: Prove that if a | b and a | c, then for all integers m and n, a divides (mb+nc).
HW 14, due M 3/13: Read relevant parts of Sec 4.1 (we're skipping some of the terminology). Do Sec 4.1: 2, 4-8, 9bfg, 36-38.
HW 13.1, due W 3/1: Read Example 5 of Sec 2.5. Do Sec 2.5: 4abd.
HW 13, due M 2/27: Read Sec 2.5 p.170-174; may skip Examples 2 and 5. Do Sec 2.5: 1, 2e, 10-12, 14, 17, 19-21, 33, 34. Hint for 17: Use Theorem 1.
HW 12, due F 2/24: Do Sec 2.1: 25; Sec 2.3: 44, 45.
Midterm1, W 2/22. The exam will cover HWs 1-11 and their corresponding sections. The best way to review for the exam is to redo all homework problems, especially those that you couldn't do on your own and had to get help (or look at the solutions) for them. Make sure you can do the problems without looking at your notes or the book.
My exam questions are always like homework problems, sometimes exact copies, but usually a little modified. (Except that on the final exam I sometimes include one problem that's not quite like homework problems.)
HW 11, due F 2/17. Read Sec 2.3 p.145-151 (may skip Examples 27, 28). Do Sec 2.3: 31a, 32-35, 40, 41, 43.
HW 10, due W 2/15. Read Sec 2.3 p.138-145 up to but not including Inverse Functions and Compositions. (As usual, may skip computer related parts, such as Examples 3 & 5.) Do Sec 2.3: 1, 9abc, 10-13, 15, 21, 22, 23, 25, 27.
HW 9, due M 2/13. Read Sec 2.2; skip Membership Tables, Example 13, and Computer Representations of Sets. Also study Table 1 carefully; you should memorize De Morgan's Laws only; for the rest of the table, you should make sure you understand them so well that they become "automatic" for you without having to memorize them (you can ignore their names). Do Sec 2.2: 3, 15a,16e, 17a, 19, 23, 29, 31, 47, 51.
HW 8, due F 2/10. Read Sec 2.1; skip the remark about datatype and the paragraph on Naive Set Theory; the section on Venn Diagrams is optional (you may find it helpful for understanding some of the concepts); skip Truth Sets. Do Sec 2.1: 5, 7, 9, 17, 18, 21, 22, 26, 27, 31, 35.
HW 7, due W 2/8. Reading Sec 1.8 is optional; depending on your learning style, it may be helpful or not. I think it would be helpful to read at least Examples 3, 4, 6, 7, 9, 20. Do Sec 1.8: 7, 12, 14, 15, 17, 18, 21, 35, 41, 42.
HW 6, due M 2/6. Read Sec 1.7 p.87-90. Do Sec 1.6 1.7: 5, 16, 23-25, 28, 30, 35, 39. For #5 may use #1 & #2 and may also assume "odd+even=odd". For #28 may assume ab=0 iff a=0 or b=0.
HW 5, due F 2/3. Read Examples 10 and 11 of Sec 1.6; the rest is optional. Read Sec 1.7 p.80-87 to the end of Example 11. Do Sec 1.6: 9,15, 19, 20; Sec 1.7: 6-12.
HW 4, due W 2/1. Read Sec 1.5 (may skip Example 2). Do Sec 1.5: 8, 9, 12hijko, 13himn, 27, 31, 33, 39, 43, 44.
HW 3, due M 1/30. Read Sec 1.4 p.40-49. Do Sec 1.4: 5, 11-14, 35, 36, 43, 50-52, 59, 61.
HW 2, due F 1/27. Read Sec 1.3 p.25-31 (may ignore "contingency"). Memorize the Distributive laws in Table 6; and understand the rest of Table 6, Table 7 (except the 4th row), and Table 8 well enough that you can recognize them without having to memorize them. You should also remember the names of the Commutative, Associative, Distributive, and De Morgan's laws (Table 6), but the other names are not too important). Do Sec 1.3: 10b, 11, 12, 16, 18, 19, 22-25, 40.
HW 1, due W 1/25. Read Sec 1.1 (it may take over an hour to read and understand the entire section); you may skip all computer related topics, such as Example 8, and Bit Operations. Do Sec 1.1: 11-14, 16, 17, 21, 22, 27(ignore "inverse"), 30, 31ef, 40, 41. Hint for #40: "p or not q" is equivalent to "q -> p"; do you see why?
(For some of the even problems that you feel unsure about, it may help to do a similar odd problem that appears just before or after it so you can compare your answer with the back of the book.)