Due by 5 PM, Friday Feb. 4, 2000
(For these questions, you'll need to be sure of the meanings of remainder and greatest common divisor.)
1. Exercise 1, on page 23 of the text. Instead of "some algorithms" please come up with just two algorithms.
2. Exercise 7, part a (page 23)
3. Exercise 7, part b (page 24)
4. What will happen to Exercise 7's version of Euclid's algorithm if in step 1 the larger input is J and the smaller I ?