Handout for Math 3012. (in pdf format)


Homework assignments:


Due on Thursday, August 31 (hand in just even-numbered problems):

Sections 1.1 and 1.2: 7, 21, 23, 24, 26, 27, 36.

Section 1.3: 6, 7, 9, 15, 17, 19, 20, 21, 25.


Due on Thursday, September 7 (hand in just even-numbered problems):

Section 1.4: 1, 4, 10, 11, 14, 17, 18, 23.

Section 4.1: 1, 2, 5, 9, 10, 12, 14, 20.


Due on Thursday, September 14 (hand in just even-numbered problems):

Section 4.2: 10, 11, 12, 14, 15, 19.


Due on Thursday, September 21 (hand in just even-numbered problems):

Section 5.5: 2-5, 8-11, 16, 24.


Due on Thursday, September 28 (hand in just even-numbered problems):

Section 8.1: 5, 6bc, 11, 16, 20.

Section 8.2: 2, 5, 6, 7.


Due on Thursday, October 5 (hand in just even-numbered problems):

Section 8.3: 5, 6, 9.

Section 8.4-8.5: 2, 3, 4, 5, 6, 11, 12.


Due on Tuesday, October 10 (hand in just even-numbered problems):

Section 9.1: 2, 4, 5, 6.

Section 9.2: 1, 4, 7, 9, 12, 16, 30.

Section 9.3: 3, 4, 8, 9, 10.


Due on Thursday, October 26 (hand in just even-numbered problems):

Section 9.4: 2abef, 4, 6, 7, 9.

Section 9.5: 3, 4, 5.


Due on Thursday, November 2 (hand in just even-numbered problems):

Section 10.1: 1, 2, 3, 6.

Section 10.2: 1, 3, 12, 16, 31, 32.

Section 10.3: 1, 2, 5, 7, 8, 11.


Due on Thursday, November 9 (hand in just even-numbered problems):

Section 10.4: 1abc, 2, 3a.

Section 11.2: 3, 6, 8, 11, 12, 13.


The grader for this class is Chaitali Herange. Her email is cdherange3@mail.gatech.edu.


Due on Thursday, November 16 (hand in just even-numbered problems):

Section 11.3: 4, 6, 7, 15, 20, 22, 31.

Section 11.4: 6, 12, 13, 18, 19, 21.


NOTE: Homework for the remaining sections will not be collected. However, it will be helpful to work it out for the purpose of the final.


Homework problems:

Section 11.5: 3, 6, 9, 11, 12.

Section 11.6: 7, 8, 10a and the problems below:

1. Let X(G) denote the minimum number of colors needed to color the vertices of G so that adjacent vertices have different colors.
a. Calculate X(C_n), where C_n is the cycle with n vertices.
b. The wheel W_n is obtained from C_n by adding a new vertex x and connecting it by an edge to each of the vertices in C_n. Calculate X(W_n).
c. If we denote by D_n the graph of the regular 2n-gon and all of its longest diagonals (n diagonals joining opposite vertices), compute X(D_n).

2. When n circles are drawn in the plane, show that the regions formed can always be colored with two colors so that neighboring regions have different colors.