Chapter 2: 8 (page 31)
Prove that every odd integer is congruent to 1 modulo 4 or to 3 modulo 4.
Short Answer
It is proved that every odd integer is congruent to 1 modulo 4 or to 3 modulo 4.
Chapter 2: 8 (page 31)
Prove that every odd integer is congruent to 1 modulo 4 or to 3 modulo 4.
It is proved that every odd integer is congruent to 1 modulo 4 or to 3 modulo 4.
All the tools & learning materials you need for study success - in one app.
Get started for freeQuestion: Let be a,b,n integers with n > 1and let. Prove that the equation has distinct solution in as follows.
(a) Show that the solutions listed in exercise 13 (b) are all distinct. [Hint: if and only if .]
(b) If is any solution of , show that for some integer with . [Hint: (Why?), so thatrole="math" localid="1659168831637" . Show that and use Theorem 1.4 to show that .]
If and are elements of , and has no solutions in , prove that is a zero divisor.
Solve the equation.
in
If , prove that there is an integer such that
Without using Exercises 13 and 14, prove: If and is a unit, then the equation has a unique solution in .
What do you think about this solution?
We value your feedback to improve our textbook solutions.