Page, Section, and Exercise Numbers Refer to the Third Edition of "Discrete Mathematics with Applications" by Susanna S. Epp, Brooks/Cole (2004).
Get a LaTeX Template for the homework as a: .tex file | pdf file
Homework should be written neatly or typed up. There is a 25% bonus for homeworks that are typed up. (Figures may still by drawn by hand). Assignments should be clearly labeled. Each problem should start on a new line, with the problem number clearly marked. Each section should start on a new page with the section clearly marked. If you homework is hand written, use dark lead (at least number 2) or ink, and write in reasonably large text.
This is a class in learning proofs. Most proofs are written using complete sentences! Explain everything you do clearly. Leave lots of white space on your paper using lots of words to explain things so that it is easy to see what you are doing.
All homework assignments should be turned in together as a collection at the same time as the mid-term examination or final on which you are tested for those particular sections. Individual assignments will not be collected separately.
The 4th edition exercise numbers come from a mapping provided by the author. This mapping is a draft that has not been thoroughly checked and may contain errors. You will not be penalized for errors in this mapping. However, if you do see errors in the mapping and would like to indicate them to me please do so. Problems in parenthesis have been changed so they might not be the same in the 4th edition. You should consult the 3rd edition on reserve in Oviatt Library for these problems if you encounter difficulty. I do not have the information yet on the sections that are not shown.
| Propositional Logic: The material in Chapter 1.1-1.3 is covered in the pre-requisite class (Phil 230) and you should be familiar with it already. Sections 1.4-1.5 are not normally covered in a Discrete Math class though they are relevant applications to logic circuits. We will not discuss chapter 1 at all. These problems are suggested for you to review. If you find them difficult you should review the chapter in greater detail. | ||
| Third Edition | Fourth Edition | |
| 1.1 (p. 15) | 6,7,8,9,26,30,49,51 | 2.1.6,7,8,(9),24,26,52,54 |
| 1.2 (p.27) | 4, 15, 20, 36, 37, 39, 41 | 2.2.4,15,20,38,39,48,50 |
| 1.3 (p.41) | 1, 4, 5, 12, 24, 25, 26, 27, 28 29, 30, 31, 42, 44 | 2.3.1,4,5,13,24,25,26,27,28,29,30,31,42,44 |
| Predicate Logic: The entire chapter is core material. | ||
| Third Edition | Fourth Edition | |
| Start of Homework Set 1 | ||
| 2.1 (p.86) | 4,5,7,12, 16, 21, 22 | 3.1.4,5,7,12, 16,22ab, (25c),(23) |
| 2.2 (p.95) | 1, 2, 3, 8,9, 14, 28 | 3.2.1,2,3,8,9, 14, (38) |
| 2.3 (p.108) | 10, 13, 23, 30, 31,42 | 3.3,10, (12), 24, 31, 32, (43) |
| 2.4 (p.122) | 3, 4, 6, 11, 12, 13, 17, 18, 19 | 3.4.3,4,6,11,12,13,17,18,19 |
| Methods of Proof and Number Theory: The entire chapter is core material. | ||
| Third Edition | Fourth Edition | |
| 3.1 (p.139) | 3, 6, 8, 12, 16, 36, 37, 38, 42 | 4.1.3, 6, 8, 12, 16, 40, 41,42, 46 |
| 3.2 (p.146) | 5, 7, 15, 21, 24, 33, 34, 36 | 4.2.5, 7, (17), 22, 25, 36, 37, 39 |
| End of Homework Set 1 - HW1
SOLUTIONS Beginning of Homework Set 2 | ||
| 3.3 (p.154) | 3, 4, 5, 13, 16, 17, 18, 20, 26, 28, 34, 35, 38 | 4.3.3, 4, 5, 13, (16), 20, 21, 23, 29, 31, 37, 38, 41 |
| 3.4 (p.163) | 2, 4, 9, 18, 22, 23, 24, 50 | 4.4.2, 4, 9, 21, 47, 48, 17, 44 (problems re-ordered) |
| 3.5 (p.170) | 5, 6, 7, 13, 14, 18, 19, 24 | 4.5.5,6,7, 13, 14, 18, (19 was deleted; try 15 instead), 24. |
| 3.6 (p.178) | 4, 7, 9, 18, 20, 22 | 4.6.4, 7, (9), 20, 22, 24 |
| 3.7 (p.184) | 4, 6, 11, 15, 33, 35 | 4.7.4, 6, 11, 15, 33, 35 |
| 3.8 (p.196) | 2, 3, 5, 7, 11, 12, 15, 20 | 4.8.2, 3, 5, 7, 11, 12, 15, (20) |
| Sequences and Induction: The entire chapter is core material. | ||
| Third Edition | Fourth Edition | |
| 4.1 (p.213) | 7,13, 16, 22, 33, 34, 37, 39, 53, 57, 59, 62, 69, 73 | 5.1.7, 13, 16, 22, 44, 45, 48, 50, 54, 58, 60, 80, 87, 91 |
| 4.2 (p.226) | 2, 4, 7, 11, 12, 14, 20, 22, 26, 28, 31 | 5.2.2, 4, 7, 11, 12, 14, 21, 23, 27, 29, 31, 32 |
| 4.3 (p.233) | 3, 7, 9, 17, 21, 22, 26 | 5.3.3, 7, 9 17, 21, 22, 26 |
| 4.4 (p.242) | 2, 5, 9, 17 | 5.4.2, 9, 19. 5 is removed. Try 8 instead. |
| 4.5 (p.253) | 2, 4, 7, 9 | 5.5.2, 4, 7, 9 |
| Set Theory: the entire chapter contains core material. | ||
| Third Edition | Fourth Edition | |
| 5.1 (p.267) | 7,8,11,12,29,32,33 | 1.2.8, 1.2.9, 6.1.12, 6.1.13, (1.2.11), 6.1.35, 6.1.36 |
| 5.2 (p.280) | 2, 3, 4, 8, 10, 14, 17, 21, 29, 30 | 6.2.(2), 3, 4, 9, 11, 15, 19, 23, 31, 32 |
| 5.3 (p.290) | 2, 10, 12, 27, 30, 56 | 6.3.11, 10, 16, 34, 37, 9 |
| 5.4 (p.296) | 7, 9, 12, 13, 14 (omit section) | 6.4.19, 21, 24, 25, 26 |
| Counting: The material on counting is core to the class but the material on probability, which is not covered well in the text, is not. We will skip all mention of probability for that reason. | ||
| Third Edition | Fourth Edition | |
| 6.1 (p.300) | 21a,22a, 23ab, 24a, 25a, 27,29 | |
| 6.2 (p.318) | 2,5,10,12,1623,24,25,29,37,39 | |
| 6.3 (p.330) | 2,8,10,2123,26,27 | |
| 6.4 (p.347) | 5,7,14,17,23 | |
| 6.5 (p.355) | 1,2,8,12, 15a | |
| 6.6 (p.361) | 7, 10, 11,13 | |
| 6.7 (p.369) | 20,21,27,29 | |
| Functions: This is an important topic but less central; we may cover it more quickly than other chapters. | ||
| 7.1 (p.399) | 2,3,411,12,13, 15, 22, 27, 32, 33. Note: Read 7.2 before doing the problems on logarithms. | |
| 7.2 (p.417) | 8,9,13, 19, 28, 33, 54, 54 | |
| 7.5 (p.454) | 5, 12, 17, 25, 37 | |
| Recursion: This material is completely optional to the class. If we are running behind we may skip this chapter and go on to recursion | ||
| 8.1 (p.472) | 4, 6, 10, 12, 16, 29, 36, 38 | 5.6.4, 6, 10, 12, 30; 9.3.25, 27 |
| 8.2 (p.485) | 4, 7, 8, 20, 23, 25, 29, 32, 33 | 5.7.4, 7, 8, 20, 23, 25, 29, 32, 33 |
| 8.3 (p.498) | 2, 3, 4, 15, 23 | 5.8.2, 3, 4, 15, 23 |
| 8.4 (p.507) | 2, 5, 9, 15, 17, 25, 28, 29 | 5.9.2, 13, 6, 15, 17, (old 8.4.25 is deleted), 21, 21 |
| Efficiency of Algorithms: This material is not normally covered in Discrete Mathematics but is an important application. We will try to cover it if we have time. | ||
| 9.1 (p.517) | 1, 3, 10, 12, 13 | |
| 9.2 (p.529) | ||
| 9.3 (p.540) | ||
| 9.4 (p.555) | ||
| 9.5 (p.569) | ||
| Relations: We probably won't get to this chapter, but if we do, we will try to cover the first 3 sections. | ||
| 10.1 (p.582) | ||
| 10.2 (p.592) | ||
| 10.3 (p.608) | ||
| Graphs and Trees: It is unlikely we will get this far. There is a separate class (Math 482) that covers this material in detail. | ||
| 11.1 (p.662) | ||
| 11.5 (p.721) | ||