CSE 321 Assignment #4
Autumn 1998

Due: Friday, October 23, 1998.

Reading assignment: Read the text, Discrete Mathematics and Its Applications, Finish reading section 2.3 and read the part of section 2.4 for Euclid's algorithm. We will begin section 3.2 on induction at the end of this week. The following problems are from the Third Edition of the text.

Practice Problems: Page 182, Problems 19, 29; Page 125, Problem 33; Page 149, Problem 11

Problems:

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

  2. Section 3.1, page 182, Problem 20

  3. Section 3.1, page 182, Problem 26

  4. (Bonus) Section 3.1, page 182, Problem 36

  5. Section 3.1, page 182, Problem 44

  6. Section 2.3, page 125, Problem 24

  7. Use the Euclidean algorithm to find the greatest common divisor of 832 and 247.

  8. Section 2.3, page 125, Problem 32

  9. Section 2.5, page 149, Problem 12

  10. (Bonus) Prove that any prime number bigger than 3 is congruent to 1 or 5 modulo 6.