abstract algebra: a study guide for beginners - Northern Illinois ...
abstract algebra: a study guide for beginners - Northern Illinois ...
abstract algebra: a study guide for beginners - Northern Illinois ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
6 CHAPTER 1. INTEGERS<br />
SOLVED PROBLEMS: §1.3<br />
29. Solve the congruence 42x ≡ 12 (mod 90).<br />
30. (a) Find all solutions to the congruence 55x ≡ 35 (mod 75).<br />
(b) Find all solutions to the congruence 55x ≡ 36 (mod 75).<br />
31. (a) Find one particular integer solution to the equation 110x + 75y = 45.<br />
(b) Show that if x = m and y = n is an integer solution to the equation in part (a),<br />
then so is x = m + 15q and y = n − 22q, <strong>for</strong> any integer q.<br />
32. Solve the system of congruences x ≡ 2 (mod 9) x ≡ 4 (mod 10) .<br />
33. Solve the system of congruences x ≡ 5 (mod 25) x ≡ 23 (mod 32) .<br />
34. Solve the system of congruences 5x ≡ 14 (mod 17) 3x ≡ 2 (mod 13) .<br />
35. Give integers a, b, m, n to provide an example of a system<br />
that has no solution.<br />
x ≡ a (mod m) x ≡ b (mod n)<br />
36. Find the additive order of each of the following integers, module 20: 4, 5, 6, 7, and 8.<br />
Note: The additive order of a modulo n is defined in Exercise 1.3.7 in the text. It is<br />
the smallest positive solution of the congruence ax ≡ 0 (mod n).<br />
37. (a) Compute the last digit in the decimal expansion of 4 100 .<br />
(b) Is 4 100 divisible by 3?<br />
38. Find all integers n <strong>for</strong> which 13 | 4(n 2 + 1).<br />
39. Prove that 10 n+1 + 4 · 10 n + 4 is divisible by 9, <strong>for</strong> all positive integers n.<br />
40. Prove that <strong>for</strong> any integer n, the number n 3 + 5n is divisible by 6.<br />
41. Use techniques of this section to prove that if m and n are odd integers, then m 2 − n 2<br />
is divisible by 8. (See Problem 1.2.36.)<br />
42. Prove that 4 2n+1 − 7 4n−2 is divisible by 15, <strong>for</strong> all positive integers n.<br />
43. Prove that the fourth power of an integer can only have 0, 1, 5, or 6 as its units digit.<br />
44. Solve the following congruences.<br />
(a) 4x ≡ 1 (mod 7)<br />
(b) 2x ≡ 1 (mod 9)<br />
(c) 5x ≡ 1 (mod 32)<br />
(d) 19x ≡ 1 (mod 36)<br />
MORE PROBLEMS: §1.3