Homework assignments for Math 28b, Spring 1998
Problem Set 5. Due Thursday March 12, 1998
- Page 223 B1,B3, C1,C2
- Page 224 D1,D2
- Page 225 G1-G3, G5
- Using the Euclidean Algorithm find the gcd of 49,349 and 15,555.
- Suppose that a and n are relatively prime integers. Show that a has an inverse in
Z/n. Show that for any b, the congruence ax = b has a solution in Z/n.
- Use the Euclidean algorithm to find numbers s and t with 96s + 37t = 1. Explain how this finds the inverse of 37 (mod 96) and the inverse of 96 (mod 37).