Discrete mathematics (Math 42), Fall 2014

MacQuarrie Hall 320, MW 10:30-11:45am (Sec. 01, code 40439)

Last update of this page: Tue Dec 09, 2014

Announcements:

Administrative handouts:

Course greensheet, Information sheet.

Course notes:

Course mechanics: Homework in Math 42, Writing math in paragraph style.

Course material: Proof notes. Logic gates, How to outline an induction proof, Algorithms, recursion, and induction (UPDATED THU OCT 09).

Topics for exams:

Exam 1, Exam 2, Exam 3, Final exam.

Sample exams:

Exam 1, Exam 2, Exam 3, Final exam.

Homework:

All problems are to be answered in paragraph style; that is, answers should be (brief) explanations in complete sentences.

HW Due date Problems
HW00 Wed Aug 27 Buy the textbook and bring it in
HW01 Wed Aug 27 (1.2) 4, 8, 9, 11, 12.
HW02 Wed Sep 03 (1.7) 2, 3, 9, 10, 13, 20.
HW03 Mon Sep 08 (2.9) 1 (explain), 6, 8, 11, 13, 14.
HW04 Wed Sep 10 (2.9) 5, 9, 12, 16, 18, 23.
HW05 Mon Sep 15 See handout.
HW06 Wed Sep 17 See handout. (Related cartoon.)
HW07 Mon Sep 22 (3.13) 1, 4, 7 (assume n>2), 14, 16, 17 (prove = explain why this is true).
HW08 Wed Oct 01 (3.13) 2, 8, 9, 10, 19, 21.
HW09 Mon Oct 06 (4.11) 5, 7, 12, 19. (All proofs should be by induction.)
HW10 Mon Oct 13 (4.11) 8, 9; (Notes) 2, 4 (UPDATED THU OCT 09).
HW11 Wed Oct 15 (5.9) 2, 3, 8, 11, 15, 21.
HW12 Mon Oct 20 See handout. (Includes (6.13) 1, 3, 8, 10.)
HW13 Wed Oct 22 (6.13) 4, 13, 14, 15, 16, 22.
HW14 Wed Oct 29 (6.13) 5, 7, 9, 17, 19, 21.
HW15 Mon Nov 03 (7.9) 1, 2, 9, 11, 16, 20.
HW16 Wed Nov 05 (7.9) 5, 13, 14, 19, 22, 25.
HW17 Mon Nov 10 (7.9) 6, 7, 8, 12(a)-(c), 15, 17.
HW18 Wed Nov 12 (8.12) 2, 4, 5, 16(b,c,d,e) (induction not needed on 16(b,c,d,e)). (Update: Yes 4, not 16(f).)
HW19 Mon Nov 17 (8.12) 6, 9, 11, 15, 19, 21 (challenge optional).
HW20 Wed Nov 19 (8.12) 7, 14, 17, 20, 22.
HW21 Mon Nov 24 (10.11) 1, 2, 3, 4, 5, 23.
HW22 Mon Dec 01 (10.11) 7, 8, 11, 13, 14.
HW23 Wed Dec 03 (14.10) 1, 3, 10(a)-(c), 16, 19, 20.
HW24 Mon Dec 08 (14.10) 4, 5(a)-(g), 9, 10(d)-(f), 12, 23.
HW25 Wed Dec 10 (11.10) 4, 6, 8, 13, 14, 17.

Reading assigned in course:

Discrete Mathematics with Ducks: 1.1-1.5, 2.1-2.3, Logic gates, 2.4-2.5, 3.1-3.8, 4.1-4.4, How to outline an induction proof, Algorithms, recursion, and induction, 5.3-5.4, 6.1-6.8, 7.1-7.5, 8.1-8.4, 8.5-8.7, 8.8-8.9, 10.1-10.3, 10.4, 14.1-14.3, 11.1-11.3, 11.5-11.7.

Proof notes: Sections 1-6.