If \(x \in A \cup (B \cap C)\text{,}\) then either \(x \in A\) or \(x \in B \cap C\text{.}\) Thus, \(x \in A \cup B\) and \(A \cup C\text{.}\) Hence, \(x \in (A \cup B) \cap (A \cup C)\text{.}\) Therefore, \(A \cup (B \cap C) \subset (A \cup B) \cap (A \cup C)\text{.}\) Conversely, if \(x \in (A \cup B) \cap (A \cup C)\text{,}\) then \(x \in A \cup B\) and \(A \cup C\text{.}\) Thus, \(x \in A\) or \(x\) is in both \(B\) and \(C\text{.}\) So \(x \in A \cup (B \cap C)\) and therefore \((A \cup B) \cap (A \cup C) \subset A \cup (B \cap C)\text{.}\) Hence, \(A \cup (B \cap C) = (A \cup B) \cap (A \cup C)\text{.}\)
1.3.10.
Hint.
\((A \cap B) \cup (A \setminus B) \cup (B \setminus A) = (A \cap B) \cup (A \cap B') \cup (B \cap A') = [A \cap (B \cup B')] \cup (B \cap A') = A \cup (B \cap A') = (A \cup B) \cap (A \cup A') = A \cup B\text{.}\)
1.3.14.
Hint.
\(A \setminus (B \cup C) = A \cap (B \cup C)' = (A \cap A) \cap (B' \cap C') = (A \cap B') \cap (A \cap C') = (A \setminus B) \cap (A \setminus C)\text{.}\)
1.3.17.
Hint.
(a) Not a map since \(f(2/3)\) is undefined; (b) this is a map; (c) not a map, since \(f(1/2) = 3/4\) but \(f(2/4)=3/8\text{;}\) (d) this is a map.
1.3.18.
Hint.
(a) \(f\) is one-to-one but not onto. \(f({\mathbb R} ) = \{ x \in {\mathbb R} : x \gt 0 \}\text{.}\) (c) \(f\) is neither one-to-one nor onto. \(f(\mathbb R) = \{ x : -1 \leq x \leq 1 \}\text{.}\)
1.3.20.
Hint.
(a) \(f(n) = n + 1\text{.}\)
1.3.22.
Hint.
(a) Let \(x, y \in A\text{.}\) Then \(g(f(x)) = (g \circ f)(x) = (g \circ f)(y) = g(f(y))\text{.}\) Thus, \(f(x) = f(y)\) and \(x = y\text{,}\) so \(g \circ f\) is one-to-one. (b) Let \(c \in C\text{,}\) then \(c = (g \circ f)(x) = g(f(x))\) for some \(x \in A\text{.}\) Since \(f(x) \in B\text{,}\)\(g\) is onto.
1.3.23.
Hint.
\(f^{-1}(x) = (x+1)/(x-1)\text{.}\)
1.3.24.
Hint.
(a) Let \(y \in f(A_1 \cup A_2)\text{.}\) Then there exists an \(x \in A_1 \cup A_2\) such that \(f(x) = y\text{.}\) Hence, \(y \in f(A_1)\) or \(f(A_2) \text{.}\) Therefore, \(y \in f(A_1) \cup f(A_2)\text{.}\) Consequently, \(f(A_1 \cup A_2) \subset f(A_1) \cup f(A_2)\text{.}\) Conversely, if \(y \in f(A_1) \cup f(A_2)\text{,}\) then \(y \in f(A_1)\) or \(f(A_2)\text{.}\) Hence, there exists an \(x\) in \(A_1\) or \(A_2\) such that \(f(x) = y\text{.}\) Thus, there exists an \(x \in A_1 \cup A_2\) such that \(f(x) = y\text{.}\) Therefore, \(f(A_1) \cup f(A_2) \subset f(A_1 \cup A_2)\text{,}\) and \(f(A_1 \cup A_2) = f(A_1) \cup f(A_2)\text{.}\)
1.3.25.
Hint.
(a) The relation fails to be symmetric. (b) The relation is not reflexive, since \(0\) is not equivalent to itself. (c) The relation is not transitive.
1.3.28.
Hint.
Let \(X = {\mathbb N} \cup \{ \sqrt{2}\, \}\) and define \(x \sim y\) if \(x + y \in {\mathbb N}\text{.}\)
2The Integers 2.3Exercises
2.3.1.
Hint.
The base case, \(S(1): [1(1 + 1)(2(1) + 1)]/6 = 1 = 1^2\) is true. Assume that \(S(k): 1^2 + 2^2 + \cdots + k^2 = [k(k + 1)(2k + 1)]/6\) is true. Then
so \(S(k + 1)\) is true. Therefore, \(S(n)\) is true for all positive integers \(n\text{.}\)
2.3.17.Fibonacci Numbers.
Hint.
For (a) and (b) use mathematical induction. (c) Show that \(f_1 = 1\text{,}\)\(f_2 = 1\text{,}\) and \(f_{n + 2} = f_{n + 1} + f_n\text{.}\) (d) Use part (c). (e) Use part (b) and Exercise 2.3.16.
2.3.20.
Hint.
Use the Fundamental Theorem of Arithmetic.
2.3.25.
Hint.
Use the Principle of Well-Ordering and the division algorithm.
2.3.29.
Hint.
Since \(\gcd(a,b) = 1\text{,}\) there exist integers \(r\) and \(s\) such that \(ar + bs = 1\text{.}\) Thus, \(acr + bcs = c\text{.}\)
2.3.31.
Hint.
Every prime must be of the form \(2\text{,}\)\(3\text{,}\)\(6n + 1\text{,}\) or \(6n + 5\text{.}\) Suppose there are only finitely many primes of the form \(6k + 5\text{.}\)
Assume there is an isomorphism \(\phi: {\mathbb C} \rightarrow {\mathbb R}\) with \(\phi(i) = a\text{.}\)
4.5.18.
Hint.
False. Assume there is an isomorphism \(\phi: {\mathbb Q}(\sqrt{2}\, ) \rightarrow {\mathbb Q}(\sqrt{3}\, )\) such that \(\phi(\sqrt{2}\, ) = a\text{.}\)
Let \(a/b, c/d \in {\mathbb Z}_{(p)}\text{.}\) Then \(a/b + c/d = (ad + bc)/bd\) and \((a/b) \cdot (c/d) = (ac)/(bd)\) are both in \({\mathbb Z}_{(p)}\text{,}\) since \(\gcd(bd,p) = 1\text{.}\)
4.5.25.
Hint.
Suppose that \(x^2 = x\) and \(x \neq 0\text{.}\) Since \(R\) is an integral domain, \(x = 1\text{.}\) To find a nontrivial idempotent, look in \({\mathbb M}_2({\mathbb R})\text{.}\)
(a) No zeros in \({\mathbb Z}_{12}\text{;}\) (c) \(3\text{,}\)\(4\text{.}\)
5.5.7.
Hint.
Look at \((2x + 1)\text{.}\)
5.5.9.
Hint.
One factorization is \(x^2 + x + 8 = (x + 2)(x + 9)\text{.}\)
5.5.12.
Hint.
False.
5.5.14.
Hint.
Look at Euclid’s proof of the infinitude of prime numbers in Theorem 2.14.
5.5.15.
Hint.
(a) Reducible; (c) irreducible.
5.5.17.
Hint.
The integers \(\mathbb Z\) do not form a field.
5.5.22.
Hint.
Does the element \(x\) have a multiplicative inverse?
5.5.24.
Hint.
Let \(\phi : R \rightarrow S\) be an isomorphism. Define \(\overline{\phi} : R[x] \rightarrow S[x]\) by \(\overline{\phi}(a_0 + a_1 x + \cdots + a_n x^n) = \phi(a_0) + \phi(a_1) x + \cdots + \phi(a_n) x^n\text{.}\)
is called the cyclotomic polynomial. Show that \(\Phi_p(x)\) is irreducible over \({\mathbb Q}\) for any prime \(p\text{.}\)
6Factorization in Integral Domains 6.5Exercises
6.5.1.
Hint.
Note that \(z^{-1} = 1/(a + b\sqrt{3}\, i) = (a -b \sqrt{3}\, i)/(a^2 + 3b^2)\) is in \({\mathbb Z}[\sqrt{3}\, i]\) if and only if \(a^2 + 3 b^2 = 1\text{.}\) The only integer solutions to the equation are \(a = \pm 1, b = 0\text{.}\)
Let \(z = a + bi\) and \(w = c + di \neq 0\) be in \({\mathbb Z}[i]\text{.}\) Prove that \(z/w \in {\mathbb Q}(i)\text{.}\)
6.5.11.
Hint.
Let \(a = ub\) with \(u\) a unit. Then \(\nu(b) \leq \nu(ub) \leq \nu(a)\text{.}\) Similarly, \(\nu(a) \leq \nu(b)\text{.}\)
6.5.12.
Hint.
Prove that if \(b\) is not a unit, then \(\nu(ab) > \nu(a)\) and then use induction on the valuation.
6.5.19.
Hint.
Show that 6 can be factored in two different ways.
7Ideals 7.4Exercises
7.4.1.
Hint.
(a) \(\{0 \}\text{,}\)\(\{0, 9 \}\text{,}\)\(\{0, 6, 12 \}\text{,}\)\(\{0, 3, 6, 9, 12, 15 \}\text{,}\)\(\{0, 2, 4, 6, 8, 10, 12, 14, 16 \}\text{;}\) (c) there are no nontrivial ideals.
7.4.3.
Hint.
If \(I \neq \{ 0 \}\text{,}\) show that \(1 \in I\text{.}\)
7.4.9.
Hint.
Let \(a \in R\) with \(a \neq 0\text{.}\) Then the principal ideal generated by \(a\) is \(R\text{.}\) Thus, there exists a \(b \in R\) such that \(ab =1\text{.}\)
be in \(S_n\text{.}\) All of the \(a_i\)s must be distinct. There are \(n\) ways to choose \(a_1\text{,}\)\(n-1\) ways to choose \(a_2\text{,}\)\(\ldots\text{,}\) 2 ways to choose \(a_{n - 1}\text{,}\) and only one way to choose \(a_n\text{.}\) Therefore, we can form \(\sigma\) in \(n(n - 1) \cdots 2 \cdot 1 = n!\) ways.
The identity of \(G\) is \(1 = 1 + 0 \sqrt{2}\text{.}\) Since \((a + b \sqrt{2}\, )(c + d \sqrt{2}\, ) = (ac + 2bd) + (ad + bc)\sqrt{2}\text{,}\)\(G\) is closed under multiplication. Finally, \((a + b \sqrt{2}\, )^{-1} = a/(a^2 - 2b^2) - b\sqrt{2}/(a^2 - 2 b^2)\text{.}\)
\(|\langle g \rangle \cap \langle h \rangle| = 1\text{.}\)
9.4.33.
Hint.
The identity element in any group has finite order. Let \(g, h \in G\) have orders \(m\) and \(n\text{,}\) respectively. Since \((g^{-1})^m = e\) and \((gh)^{mn} = e\text{,}\) the elements of finite order in \(G\) form a subgroup of \(G\text{.}\)
The group of rigid motions of the cube can be described by the allowable permutations of the six faces and is isomorphic to \(S_4\text{.}\) There are the identity cycle, 6 permutations with the structure \((abcd)\) that correspond to the quarter turns, 3 permutations with the structure \((ab)(cd)\) that correspond to the half turns, 6 permutations with the structure \((ab)(cd)(ef)\) that correspond to rotating the cube about the centers of opposite edges, and 8 permutations with the structure \((abc)(def)\) that correspond to rotating the cube about opposite vertices.