CSE 321 Assignment #2
Autumn 1997

Due: Friday, October 17, 1997.

Reading assignment: Read the text, Discrete Mathematics and Its Applications, Section 3.1 and read the supplementary logic notes. We will also cover material from section 2.3. The following problems are from the Third Edition of the text.

Practice Problems:

Problems:

  1. Section 1.3, page 34, Problem 6.

  2. Section 1.3, page 34, Problem 10.

  3. Section 1.3, page 35, Problem 12.

  4. Section 1.3, page 35, Problem 14.

  5. Show that the formula FORALL x (P(x) -> Q(x)) is not logically equivalent to the formula FORALL x P(x) -> FORALL x Q(x). Give examples of predicates P and Q and an associated universe which demonstrate that the two expressions are not equivalent.

  6. Section 3.1, page 181, Problem 8. Instead of part (b), give an indirect proof of the following: "If n squared is odd then so is n."

  7. Section 3.1, page 181, Problem 10

  8. Prove or disprove that n*n + 3*n + 1 is always prime.

  9. (Bonus) page 182, Problem 32