Final Exam, Fall 2003 Professor J. L.
Gross
Mon 15 Dec 03 CS W3203 Discrete Math
DISCRETE MATH1 W3203 Final Exam
open book
SOLUTIONS
_________________________________
Your Name (2 pts for LEGIBLY PRINTING your name on this line)
Problem Points Score
your name 2
1 18
2 20
3 20
4 25
5 25
6 30
7 35
8 25
_______________________
Total 200
SUGGESTION: Do the EASIEST problems first!
HINT: Some of the solution methods involve highschool
math as well as new methods from this class.
1An example of the Reasonable Person Principle: A reasonable student expects to lose a lot of credit for
neglecting to EXPLAIN an answer. Omit explanations at your own risk.
W3203FXsol.F03 1 of 8 11/30/08
Final Exam, Fall 2003 Professor J. L. Gross
Mon 15 Dec 03 CS W3203 Discrete Math
1a (3 pts). For the following recursion, calculate a 3 , a 4 and a5 .
n n
a 0 = 0, a1 = 1, a 2 = 2; an = a n−1 + a n−2 for n ≥ 3
n−1 n− 2
3 2
SOL. a 3 = ⋅ 2 + ⋅1 = 6;
2 1
4 4 5 5
a 4 = ⋅6 + ⋅ 2 = 12; a 5 = ⋅12 + ⋅ 6 = 25;
3 2 4 3
1b (15). Use induction to prove that an = nfn , where fn is the nth
number in the Fibonacci sequence 0, 1, 1, 2, 3, 5, … .
BASIS : true for a 0 , a1 , and a 2
IND HYP: assume true for a n−1 and a n− 2 n ≥ 3
n n
IND STEP : a n = a n−1 + a
n−1 n−2 n−2
n n
=
n−1
(n − 1)fn−1 +
n−2
(n − 2)fn−2
= nfn−1 + nfn−2 = n(fn−1 + fn−2 ) = nfn
W3203FXsol.F03 2 of 8 11/30/08
Final Exam, Fall 2003 Professor J. L. Gross
Mon 15 Dec 03 CS W3203 Discrete Math
2 (20 pts). Solve the following recursion:
a 0 = 2, a1 = 3; 6an = 5an−1 − a n−2
1 1
SOL. 6r 2 − 5r + 1 = (3r − 1)(2r − 1) = 0 r = ,
3 2
an = B
1 n
3
+C() ()
1 n
2
a0 = 2 = B + C B = −12
B C solve
a1 = 3 = + C = 14
3 2
() ()
n
1 n
an = (−12 )
1
+ 14
3 2
3 (20 pts). Calculate the value of the general coefficient an in the
2 − 3x ∞
power series expansion = ∑ a n x n
1 − 10x + 21x 2 n=0
SOL. partial fractions
2 − 3x 2 − 3x A B
2 = = +
1 − 10x + 21x (1 − 3x )(1− 7x ) 1 − 3x 1 − 7x
3
A +B = 2 A=−
solve 4
−7A − 3B = −3 B=
11
4
3 11
an = − ⋅3n + ⋅ 7n
4 4
W3203FXsol.F03 3 of 8 11/30/08
Final Exam, Fall 2003 Professor J. L. Gross
Mon 15 Dec 03 CS W3203 Discrete Math
4 (25). For two positive integers, we write m n if the sum of the
(distinct) prime factors of the first is less than or equal to the product
of the (distinct) prime factors of the second. For instance, 75 14 ,
because 3 + 5 ≤ 2 ⋅ 7 .
4a (5). Is this relation reflexive? Explain.
SOL. Yes, because the product of positive integers greater
than or equal to 2 is less than their sum.
4b (10). Is this relation anti-symmetric? Explain.
SOL. No, because 33 26 and 26 33 , but 26 ≠ 33.
4c (10). Is this relation transitive? Explain.
SOL. No, because 33 35 and 35 13 , but ¬(33 13).
W3203FXsol.F03 4 of 8 11/30/08
Final Exam, Fall 2003 Professor J. L. Gross
Mon 15 Dec 03 CS W3203 Discrete Math
5a (10). Draw two non-isomorphic 5-vertex, 5-edge simple graphs
with the same degree sequence.
SOLUTION.
5b (15). Draw all possible 7-vertex trees with maximum degree 3.
SOLUTION. The degree seq is either 3321111 or 3222111.
W3203FXsol.F03 5 of 8 11/30/08
Final Exam, Fall 2003 Professor J. L. Gross
Mon 15 Dec 03 CS W3203 Discrete Math
6 (30pts). Which pairs of these graphs are isomorphic. Explain.
1 2
A B 0 1 2
0 5 C
4
3 4 5
3 8
6 7 8
6 7
SOLUTION. A ≅ C as shown by vertex labelling above.
Zillions of reasons why A and B are non-isomorphic. E.g.,
(1) A is nonplanar (see problem #8) but B is planar.
(2) B has pairs of 3-cycles that share an edge, but C does not.
W3203FXsol.F03 6 of 8 11/30/08
Final Exam, Fall 2003 Professor J. L. Gross
Mon 15 Dec 03 CS W3203 Discrete Math
7a (10 pts). Calculate the chromatic number of this graph?
4 5 4 1 5
1 2 3
SOL. Given 5-coloring shows 5 is upper bound. Bold K5
shows 5 is lower bound.
7b (15). Show three place where adding a single edge would increase
the chromatic number.
SOL. Of the six missing
edges, these three work.
7c (10). Show where to delete an edge to decrease the chromatic
number.
SOL. Delete the marked edge.
Then start with 5-coloring of
part (a), and recolor the bottom
right vertex with color 2.
X
W3203FXsol.F03 7 of 8 11/30/08
Final Exam, Fall 2003 Professor J. L. Gross
Mon 15 Dec 03 CS W3203 Discrete Math
8a (10 pts). Decide whether the following graph is planar.
SOL. Easy proof – bipartite as
shown. E = 13. V= 8.
13 = E > 2V- 4 = 12
Harder Proof. Draw K 3,3
8b (15 pts). Decide whether the following graph is planar.
Solution. NOT planar. But NOT
bipartite. Must find a Kuratowski graph.
K 5 is shown.
W3203FXsol.F03 8 of 8 11/30/08
