# CSE 321 Assignment #3

Spring 2001

### Due: Friday, April 20, 2001 at the beginning of class.

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. Also begin reading section 3.2 on induction. We will start this
by the end of the week.
The following problems are from the Fourth Edition of the text.

Practice Problems: Section 3.1, Problems 21, 29, 41; Section 2.3, Problem 35;
Section 2.5, Problem 11

Problems:

- Section 3.1, Problem 20. (Problem 10 in 3rd edition).
- Section 3.1, Problem 30, (Problem 20 in 3rd edition).
- Section 3.1, Problem 38, (Problem 26 in 3rd edition).
- Section 3.1, Problem 54, (Problem 36 in 3rd edition).
- Section 2.3, Problem 24, (Same in 3rd edition).
- Section 2.3, Problem 36, (Problem 34 in 3rd edition).
- Compute the gcd of 123 and 277 using Euclid's algorithm.
- Section 2.5, Problem 12, (Same in 3rd edition).
- (Bonus) Section 3.1, Problem 48. (Not in 3rd edition)
- (Bonus) Prove that any prime number bigger than 3 is congruent to 1 or
5 modulo 6.