Chapter 6

Abstract Algebra: Theory and Applications · 19 exercises

Problem 1

Suppose that \(G\) is a finite group with an element \(g\) of order 5 and an element \(h\) of order 7. Why must \(|G| \geq 35\) ?

5 step solution

Problem 2

Suppose that \(G\) is a finite group with 60 elements. What are the orders of possible subgroups of \(G ?\)

3 step solution

Problem 3

Prove or disprove: Every subgroup of the integers has finite index.

5 step solution

Problem 5

List the left and right cosets of the subgroups in each of the following. (a) \langle 8\rangle in \(\mathbb{Z}_{24}\) (b) \langle 3\rangle in \(U(8)\) (c) \(3 \mathbb{Z}\) in \(\mathbb{Z}\) (d) \(A_{4}\) in \(S_{4}\) (e) \(A_{n}\) in \(S_{n}\) (f) \(D_{4}\) in \(S_{4}\) (g) \(\mathbb{T}\) in \(\mathbb{C}^{*}\) (h) \(H=\\{(1),(123),(132)\\}\) in \(S_{4}\)

3 step solution

Problem 6

Describe the left cosets of \(S L_{2}(\mathbb{R})\) in \(G L_{2}(\mathbb{R})\). What is the index of \(S L_{2}(\mathbb{R})\) in \(G L_{2}(\mathbb{R})\) ?

4 step solution

Problem 7

Verify Euler's Theorem for \(n=15\) and \(a=4\).

3 step solution

Problem 8

Use Fermat's Little Theorem to show that if \(p=4 n+3\) is prime, there is no solution to the equation \(x^{2} \equiv-1(\bmod p)\).

6 step solution

Problem 9

Show that the integers have infinite index in the additive group of rational numbers.

3 step solution

Problem 10

Show that the additive group of real numbers has infinite index in the additive group of the complex numbers.

4 step solution

Problem 11

Let \(H\) be a subgroup of a group \(G\) and suppose that \(g_{1}, g_{2} \in G\). Prove that the following conditions are equivalent. (a) \(g_{1} H=g_{2} H\) (b) \(H g_{1}^{-1}=H g_{2}^{-1}\) (c) \(g_{1} H \subset g_{2} H\) (d) \(g_{2} \in g_{1} H\) (e) \(g_{1}^{-1} g_{2} \in H\)

5 step solution

Problem 12

If \(g h g^{-1} \in H\) for all \(g \in G\) and \(h \in H,\) show that right cosets are identical to left cosets. That is, show that \(g H=H g\) for all \(g \in G\).

8 step solution

Problem 14

Suppose that \(g^{n}=e .\) Show that the order of \(g\) divides \(n\).

6 step solution

Problem 15

Show that any two permutations \(\alpha, \beta \in S_{n}\) have the same cycle structure if and only if there exists a permutation \(\gamma\) such that \(\beta=\gamma \alpha \gamma^{-1}\). If \(\beta=\gamma \alpha \gamma^{-1}\) for some \(\gamma \in S_{n}\), then \(\alpha\) and \(\beta\) are conjugate.

4 step solution

Problem 16

. If \(|G|=2 n\), prove that the number of elements of order 2 is odd. Use this result to show that \(G\) must contain a subgroup of order 2 .

5 step solution

Problem 19

Let \(H\) and \(K\) be subgroups of a group \(G\). Prove that \(g H \cap g K\) is a coset of \(H \cap K\) in \(G\).

4 step solution

Problem 20

Let \(H\) and \(K\) be subgroups of a group \(G\). Define a relation \(\sim\) on \(G\) by \(a \sim b\) if there exists an \(h \in H\) and a \(k \in K\) such that \(h a k=b\). Show that this relation is an equivalence relation. The corresponding equivalence classes are called double cosets. Compute the double cosets of \(H=\\{(1),(123),(132)\\}\) in \(A_{4}\).

4 step solution

Problem 21

Let \(G\) be a cyclic group of order \(n\). Show that there are exactly \(\phi(n)\) generators for \(G\)

4 step solution

Problem 22

Let \(n=p_{1}^{e_{1}} p_{2}^{e_{2}} \cdots p_{k}^{e_{k}},\) where \(p_{1}, p_{2}, \ldots, p_{k}\) are distinct primes. Prove that $$\phi(n)=n\left(1-\frac{1}{p_{1}}\right)\left(1-\frac{1}{p_{2}}\right) \cdots\left(1-\frac{1}{p_{k}}\right) .$$

4 step solution

Problem 23

Show that $$n=\sum_{d \mid n} \phi(d)$$ for all positive integers \(n\).

4 step solution

Show/ page