CSE 321 Assignment #3
Autumn 1997

Due: Friday, October 24, 1997.

Reading assignment: Read the text, Discrete Mathematics and Its Applications, Sections 2.3 and the part of 2.4 on the Euclidean algorithm. Some material in section 2.5 will also be covered. Next Friday we will begin Section 3.2. The following problems are from the Third Edition of the text.

Problems:

  1. Section 3.1, page 181, Problem 12

  2. Section 3.1, page 182, Problem 20

  3. Section 3.1, page 182, Problem 26

  4. Section 3.1, page 182, Problem 34

  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 291 and 213.

  8. Section 2.3, page 125, Problem 34

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

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