Some Solutions To The Problems On Practice Quiz 3
Some Solutions To The Problems On Practice Quiz 3
Alexandru Suciu
MATH 3175 Group Theory Fall 2010
Subgroups: h1i, h2i, h3i, h4i, h6i, h9i, h12i, h18i, h0i
You should draw now the inclusions between these various subgroups.
(b) Make a table with all the elements of Z36 , grouped according to their orders.
You should list all elements having each possible order, and count them.
x, x3 , x7 , x9 .
3. Let G be a group, and H a subgroup of G. For any fixed x ∈ G, define the conjugate of H
by x to be
xHx−1 = {xhx−1 | h ∈ H}.
Show that xHx−1 is a subgroup of G.
Similar method.
5. Done in class.
6. Similar problem.
MATH 3175 Some solutions to the problems on Practice Quiz 3 Fall 2010
• A permutation in S7 has order 5 if and only if its cycle type is (5, 1, 1), i.e., it is a
5-cycle.
• To count such cycles, first count
7·6the number of ways to choose 5 numbers out of 7
(distinct) numbers: this is 75 = 2·1 = 21.
• Then count the number of permuting those 5 numbers (this will give the cycles of length
5), and divide this number by 5 (so as to account for the fact that one can cyclically
permute the entries in a cycle). This gives 5!/5 = 120/5 = 24.
• Finally, multiply the above two numbers, to get 21 · 24 = 504.
• Answer: there are precisely 504 permutations of degree 7 and order 5.
Proceeding as above, let us list all possibilities for cycle types in S10 which have order 6,
i.e., those (decreasing) sequences of positive numbers (λ1 , . . . , λr ) such that
• λ1 + · · · + λr = 10, and
• lcm(λ1 , . . . , λr ) = 6,
together with the number of possibilities for each type. Each time a cycle of length m
k
k!
appears, and there are k numbers at our disposal, we should multiply by m · k . Also, if a
cycle of length m gets repeated s times, we should divide by s!, which represents the number
of ways to rearrange those s cycles (of a fixed order m).
10 6! 4 3!
(6, 3, 1) 6 6 · 3 3 = 201, 600
10 6! 4 2! 2 2! 1
(6, 2, 2) 6 6 · 2 2 · 2 2 · 2! = 75, 600
10 6! 4 2!
(6, 2, 1, 1) 6 6 · 2 2 = 151, 200
10 6!
(6, 1, 1, 1, 1) 6 6 = 25, 200
10 3! 7 3! 1 4 2! 2 2! 1
(3, 3, 2, 2) 3 3 · 3 3 · 2! · 2 2 · 2 2 · 2! = 25, 200
10 3! 7 3! 1 4 2!
(3, 3, 2, 1, 1) 3 3 · 3 3 · 2! · 2 2 = 50, 400
10 3! 7 2! 5 2! 3 2! 1
(3, 2, 2, 2, 1) 3 3 · 2 2 · 2 2 · 2 2 · 3! = 25, 200
10 3! 7 2! 5 2! 1
(3, 2, 2, 1, 1, 1) 3 3 · 2 2 · 2 2 · 2! = 25, 200
10 3! 7 2!
(3, 2, 1, 1, 1, 1, 1) 3 3 · 2 2 = 5, 040