**Problem of the Week**

**Math Club**

**BUGCAT 2020**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

people:grads:ding:teach:314hm

Math 314-02 Discrete Mathematics

Fall 2014

Homework Assignments

Complete all the problems in each section of the textbook as we go through them, as well as any other problems assigned in class. I will assign certain problems to be handed in; they will be due on the Monday of the following week. Although you may (and should) work together with your class mates, such cooperation should NOT include exchange of written material. The solutions you hand in have to be your own.

**Use 8.5in x 11in paper with smooth borders. Write your name on top of each page.**

Due Wednesday, 9/10

- READ THE BOOK!
- Exercise 1.2.8 on Page 8,
- Exercise 1.2.10 on Page 8,
- Exercise 1.3.2 on Page 14,
- Exercise 1.3.3 on Page 14,
- Exercise 1.8.2 on Page 20.

Due Wednesday, 9/17

- Page 22: Exercise 1.8.17
- Page 23: Exercise 1.8.26
- Prove that n
^{3}+2n is a multiple of 3. (Hint: use induction) - Page 34: 2.3.1
- Page 41: Exercise 2.5.2

Due Wednesday, 9/24

- Page 62: Exercise 3.8.4.
- Page 63: Exercise 3.8.9.
- Page 63: Exercise 3.8.10.
- Page 63: Exercise 3.8.13.
- Page 64: Exercise 3.8.15.

Due Friday, 10/10

- Page 78: Exercise 5.1.5.
- Page 80: Exercise 5.2.1.(see the 4th paragraph of 5.1 on Page 77-78 for the event E,O,T and L.)

See the email.

Due Wednesday, 11/5

- Page 139: Exercise 7.3.3 (Only the dodecahedron).
- Page 140: Exercise 7.3.8.
- Page 140: Exercise 7.3.9.
- Page 140: Exercise 7.3.12. (K3 is the complete graph with three nodes, i.e., the triangle).

Due Friday, 14/11

- Read the section on
*Prufer Code*(Page 150-152). - Page 149: Exercise 8.4.1.
- Page 155: Exercise 8.5.4.
- Page 155: Exercise 8.5.5.

Due Friday, 12/12

- Exercise 12.3.1 on Page 195.
- Exercise 13.3.4 on Page 204.
- Exercise 13.4.7 on Page 210.
- Exercise 13.4.8 on Page 210.

people/grads/ding/teach/314hm.txt · Last modified: 2014/12/05 03:07 by ding

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported