Unformatted text preview: D Œ0Ł in Z n . 1.7.14. Suppose a is relatively prime to n . (a) Show that for all b 2 Z , the congruence ax ² b . mod n/ has a solution. (b) Can you ﬁnd an algorithm for solving congruences of this type? Hint: Consider Exercise 1.7.11 . (c) Solve the congruence 8x ² 12 . mod 125/ . 1.7.15. This exercise guides you to a proof of the Chinese remainder the-orem. (a) To prove the Chinese remainder theorem, show that it sufﬁces to ﬁnd m and n such that ˛ C ma D ˇ C nb . (b) To ﬁnd m and n as in part (a), show that it sufﬁces to ﬁnd s and t such that as C bt D .˛ ³ ˇ/ . (c) Show that the existence of s and t as in part (b) follows from a and b being relatively prime. 1.7.16. Find and integer x such that x ² 3 . mod 4/ and x ² 5 . mod 9/ . 1.8. Polynomials Let K denote the set Q of rational numbers, the set R of real numbers, or the set C of complex numbers. ( K could actually be any ﬁeld ; ﬁelds are...
View Full Document
- Fall '08
- Algebra, Prime number, Zn, invertibility