MA-410 Homework 1

Due at 10:15am in class, Wednesday, February 7, 2007


Solutions may be submitted in person in class, or you may email an ASCII text, html, or postscipt/pdf-formatted document to me.
Note my office hours on my schedule.

  1. FINT, §7, Problem 7.3(d), page 51.
  2. FINT, §36, Problem 36.3, page 295.
  3. For any integer a, show that gcd(5a+2,7a+3) = 1.
  4. FINT, §6, Problem 6.1(b), page 41. Please compute the Bezout coefficients by the extended Euclidean algorithm presented in class, not the back-substitution given in the book.
  5. Prove for the extended Euclidean algorithm described in class: sk tk+1 - sk+1 tk = (-1)k+1 for all -1 ≤ k ≤ n