Reading assignment:
Sections 3.6, and 3.7 of Chapter 3 ( = Sections 2.5, and 2.6 of Chapter 2 of the 5th Edition)

Written assignment:

1. (3 points) Exercise 14, Sec. 3.6 page 230 ( = Exercise 14, Sec. 2.5 page 180 of 5th Edition): Give a simple procedure for converting from the octal expansion of an integer to its binary expansion.
2. (3 points) Exercise 15, Sec. 3.6 page 230 ( = Exercise 15, Sec. 2.5 page 180 of 5th Edition): Convert (7345321)₈ to its binary expansion and convert (10 1011 1011)₂ to its octal expansion.
3. (3 points) Exercise 23 parts b, c, and e (only), Sec. 3.6 page 230 ( = Exercise 21 parts b, c, and e (only), Sec. 2.5 page 180 of 5th Edition): Use the Euclidean algorithm to find (b) gcd(111,201), (c) gcd(1001,1331), (d) gcd(1000,5040).
4. (3 points) Exercise 26, Sec. 3.6 page 230 ( = Exercise 24, Sec. 2.5 page 180 of 5th Edition): How many divisions are required to find gcd(34,55) using the Euclidean algorithm?
5. (3 points) Exercise 48, Sec. 2.6 page 246 ( = Exercise 48, Sec. 2.6 page 196 of 5th Edition): Use the extended Euclidean algorithm to express gcd(252,356) as a linear combination of 252 and 356.