MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof.

Todorov

1 2 3 4 5 6 7 8 9 10 11 12 13 total

Name: Solutions - AI

FINAL EXAM

The first 7 problems will each count 10 points. The best 3 of # 8-13 will count 10 points each.
Total is 100 points. A 4th problem from # 8-13 may count up to 5 pts extra credit. You may use a
calculator (but it is not needed, you may retain factorials, powers, in your answer). Closed notes.
There are some formulas at the end. Good luck!
I. Each of # 1-7 counts ten points each.

1. (a) Describe all Abelian groups of order 35 , up to isomorphism. Explain the connection with
the set of partitions of 5.
Ans. These correspond 1-1 with the seven partitions of 5:
5 4+1 3+2 3+1+1 2+2+1 2+1+1+1 1+1+1+1+1+1
Z35 Z34 ⊕ Z3 Z33 ⊕ Z32 Z33 ⊕ Z3 ⊕ Z3 Z32 ⊕ Z32 ⊕ Z3 Z32 ⊕ Z3 ⊕ Z3 ⊕ Z3 Z3 ⊕ Z3 ⊕ Z3 ⊕ Z3 ⊕ Z3

(b) Which of these have elements of order 27?

Ans The order of an element in a direct sum divides LCM(orders of factors). So the
first four have elements of order 27:
Z35 , Z34 ⊕ Z3 , Z33 ⊕ Z32 , Z33 ⊕ Z3 ⊕ Z3
(c) Determine all Abelian groups of order 75, up to isomorphism, writing each as a direct
sum of cyclic groups of prime power order.
Ans Since 75 = 52 · 3, and GCD(25, 3) = 1 an Abelian group of order 75 is the product
of a 5-group of order 25, and Z3 . There are two such 5- groups, Z25 and Z5 ⊕ Z5 , so we
have two Abelian groups of order 75. Recalling that Zmn = Zm ⊕ Zn if GCD(m, n) = 1,
we have
Z25 ⊕ Z3 ∼
= Z75 , and Z5 ⊕ Z5 ⊕ Z3 ∼
= Z5 ⊕ Z15 as the two groups, up to isomorphism.

1
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

2. Let G = (Z80 , +) = {0, 1, 2, . . . , 79} under (+ mod 80).

(a) How many elements of order 80 are there?

Ans. Since 80 = 25 · 5, φ(80) = 80(1 − 1/2)(1 − 1/5) = 32. Explanation: there are
80/2 multiples of 2, 80/5 multioles of 5, but that double counts 80/10 multiples of 10,
so 80-40-16+8=32 elements from {0, 1, . . . , 79} are relatively prime to 80.

(b) Write down 5 different elements of order 80.

Ans 1, 3, 7, 9, 11, 13, 17, 19, 21, . . ..

(c) List all elements of order 10 in G.

There is one subgroup H = h80/10i = h8i of order 10. Note that φ(10) = φ(5) · φ(2) =
4 · 1, The generators of H are the multiples of 8 by integers in U (10), so they are
8(1, 3, 7, 9) = {8, 24, 56, 72}. These are the four elements of G having order 10.

(d) Determine all subgroups of G having order 5.

Ans Since Z80 is cyclic, there is a unique subgroup W = h80/5i = h16i of order 5.
(Its generators are the multiples {16a | GCD(a, 5) = 1}, so h16i = h32i = h64i = h96i).

2
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

3. Let S7 be the group of permutations of the set {1, 2, 3, 4, 5, 6, 7}.

(a) Find one element of order 6, one of order 10 and one of order 12 in S7 .
Ans Order 6: any element with disjoint cycle decomposition (6,1), (3,2,2), or (3,2,1,1),
so g = (1, 2, 3, 4, 5, 6) suffices.
Order 10: Disjoint cycle decomposition (5,2), so g = (1, 2, 3, 4, 5) · (6, 7).
Order 12: Disjoint cycle decomposition (4,3), so g = (1, 2, 3, 4) · (5, 6, 7) is one.

(b) How many elements of order 6 are there in S7 ?

Ans There are 3 cycle decompositions:
(6,1): 76 · 5! = 7 · 5! = 840.

(3,2,1,1): 73 · 2! · 1! · 42 = 3·2·1

7·6·5
· 2 · 4·3


2·1
= 420.
(3,2,2,1): 73 · 2! · 1! · 42 2!1 = 210.

Total: 840 + 420 + 210 = 1470 elements of order 6.

(c) Prove that there are no elements of order 9 in S7 .

Ans Since the order of a product of disjoint cycles, is the LCM of the lengths, we would
need a cycle of length 9 in the disjoint cycle decomposition of g. This is possible only in
Sn , n ≥ 9.

3
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

4. Consider the group S8 of permutations of the set {1, 2, 3, 4, 5, 6, 7, 8}.

(a) Write the disjoint cycle decomposition of g = (256) · (125) · (13542).

Ans (1, 3)(2, 5, 4, 6).

(b) Let h = (1235)(46)(78). Give the disjoint cycle decompositions of h2 and of h3 .

Ans h2 = (13)(25), h3 = (1, 5, 3, 2)(46)(78).

(c) How many conjugates are there of h in S8 ?

Ans 84 · 3! · 42 · 2!1 = 8·7·6·5 · 3! · 26 = 1260



4·3·2·1

4
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

5. Let ϕ : Z10 → Z30 be the group homomorphism defined as

ϕ(x) = 6x (mod 30). You may assume that ϕ is a homomorphism.

(a) Find K = Ker(ϕ).

Ans K = {0, 5} = h5i.

(b) Find the image Im(ϕ).

Ans (0, 6, 12, 18, 24).

(c) Determine the quotient Z10 /K. List all the elements of the factor group. Write each
coset as a list of specific elements.
Ans The cosets are 0 = {0, 5}, 1 = {1, 6}, 2 = {2, 8}, 3 = {3, 8}, 4 = {4, 9}.

(d) Give the isomorphism ϕ : Z10 /K → Im(ϕ).

Ans ϕ(i) = 6i mod 30, i = 0, 1, 2, 3, 4.

5
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

6. Let S5 be the group of all permutations on 5 elements {1, 2, 3, 4, 5}.

(a) Prove that the subgroup A5 of all even permutations of the same 5 elements {1, 2, 3, 4, 5},
is a normal subgroup of S5 .
Ans. Method i: Since |A5 | = |S5 |/2, then gA5 = A5 = A5 g for g ∈ A5 . And gA5 =
S5 − A5 = A5 g if g ∈
/ A5 . If follows that A5 is normal. This proof shows that if H has
index 2 in G, (|G| = 2|H|), then H is normal in G.

Method ii. If g is even, and h ∈ A5 , then ghg −1 is the product of three evens, so is even.
If g is odd, then so is g −1 , since g −1 has the same lengths of disjoint cycles as g, and
these lengths determine whether g −1 is even or odd.1
But then ghg − 1 is the product of an (odd × even × odd) is itself even.
In each case ghg −1 ∈ A5 so A5 is normal in S5 .

(b) Prove that the subgroup H = h(254)i generated by the permutation (254) is not a normal
subgroup of S5 .
Ans. Consider g = (12). Then g(254)g −1 = (154) ∈
/ H = {(2, 5, 4), (2, 4, 5), e}. This
shows that H is not normal in S5 .

(c) Determine which subgroups H 0 of S5 are conjugates of H. Your answer should be either
a list, or an intrinsic property of H 0 that explains simply how to identify a conjugate,
(not just the definition that ∃g ∈ S5 | H 0 = gHg −1 .)
Ans.. Since H is generated by a 3-cycle, the conjugates are all subgroups H 0 generated
by a 3-cycle, so all of the form h(a, b, c)i.
In fact, (a, 2)(b, 5)(c, 4)·(254)·((a, 2)(b, 5)(c, 4))−1 = (a, b, c), so taking g = (a, 2)(b, 5)(c, 4)
we have gHg −1 = h(a, b, c)i. There are 53 /2 = 10 conjugates (divide by 2 since (a, b, c)

and (a, c, b) generate the same subgroup ).

1
An odd length cycle is the product of an even number of transpositions so is even, and an even length cycle
is the product of an odd number of transpositions, so is odd. (Worthy of Charles L. Dodgson, alias Lewis Carroll,
mathematician and author of ”Alice in Wonederland”)

6
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

7. Let G be a group of order |G| = 75.

(a) Find the possible values for r5 , the number of 5-Sylow subgroups.
Ans. Since 75 = 52 · 3, r5 ≡ 1 mod 5 and divides 3, so the only possibility is r5 = 1.

(b) Find the possible values for r3 , the number of 3-Sylow subgroups.
. Ans. Since 75 = 25 · 3, r3 ≡ 1 mod 3 and divides 25. The divisors of 25 are 1, 5, 25,
and 5 ≡ 2 mod 3 so r3 = 1 or 25.

(c) Prove that there are no simple groups of order 75. That is, prove that a group of order
75 must contain a proper normal subgroup other than the identity subgroup.
Ans. Since r5 = 1, the 5-Sylow subgroup H, of order 25, has as conjugate only itself, so
is normal in G.

7
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

II. The best 3 of #8-13 count ten points each. A 4-th may count 5 pts EC.

8. Let G = A ⊕ B be the external direct product. Assume that |A| = 25 and |B| = 10, and let
(eA , eB ) be the identity element of G.

(a) What is |G|?

Ans |A ⊕ B| = |A| · |B| = 250. (The direct sum has as base set all pairs (a, b) | a ∈ A, b ∈
B)

(b) What are the possible orders of elements of G?

Ans. The order of (a, b) ∈ G, is |(a, b) = LCM(|a|, |b|) so must divide LCM (|A|, |B|) =
LCM (25, 10) = 50. So the possible orders are 1,2,5,10,25,50.

(c) Prove that the subgroup H = {(a, eB ) | a ∈ A} is a normal subgroup of G. You may
assume that H is a subgroup of G.
Ans First, easier proof : We must show ghg −1 ∈ H for all g ∈ G. Let g = (a1 , b). (Note:
We must choose a1 possibly different from a). Since (a1 , b)−1 = (a−1 −1
1 , b ) we have

(a1 , b) · (a, eB ) · (a1 , b)−1 = (a1 · a · a1 −1 , b · eB · b−1 ) = (a1 · a · a1 −1 , eB ) ∈ H

proving that H is normal in G.
Second proof. We must show that ∀g ∈ G, gH = Hg as sets. Let g = (a1 , b), then
gH = (a1 , b) · {a, eB ) | a ∈ H} = {(a1 · a, b · eB ) | a ∈ A} = (A, b)
since {a1 a | a ∈ A} = A, as, given a2 ∈ A take a = (a1 )−1 a2 , and a1 · ((a1 )−1 · a2 ) = a2 .
Similarly,
Hg = {a, eB ) | a ∈ H} · (a1 , b) = {(a · a1 , eB · b) | a ∈ A} = (A, b),
so the left coset gH = Hg, the right coset.
Note: Often in proving a subgroup is normal, the criterion gHg −1 ∈ H in the first proof
is simpler to use than the equality of cosets in the second proof. But you may wish
to consider which definition is more useful, when showing that N is normal has some
partiuclar consequence.
Also, in general a1 a 6= aa1 , since A is not assumed commutative. So key to the second
proof is that a1 A = Aa1 = A as sets, since A is a group.

8
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

9. (a) Determine the order |U (75)| of the group U (75) of those integers
{i | 0 ≤ i ≤ 74 | GCD (i, 75) = 1} which have multiplicative inverses mod 75.
Ans. We have U (75) ∼ = U (25) · U (3) ∼ = Z20 ⊕ Z2 ∼= Z4 ⊕ Z5 ⊕ Z2 , of order 40.
Or, U (75) = 75(1 − 1/5)(1 − 1/3) = 40 (One eliminates the multiples of 5, then the
multiples of 3, but one has double counted the multiples of 15: this is inclusion-exclusion
in combinatorics. For m = pn1 1 · · · pnr r we have, similarly φ(m) = m(1−1/p1 ) · · · (1−1/pr ).

(b) Prove that U (9) and D3 have the same number of elements, but are not isomorphic.
(D3 is the dihedral group.)
Ans U9 ∼ = Z9−3 = Z6 so |U9 | = 6 = |S3 |. But U (9) is Abelian (commutative), and S3 is
not since (12)(123) 6= (123) · (12).
Or U (9) is cyclic with a generator (2) of order 6, and S3 has no element of order 6.
(Students cited other properties where they are different, for example U (9) has a unique
element of order 2, but S3 has 3 order two cycles (12), (13), (23).

(c) Prove that Z15 and Z5 ⊕ Z3 are isomorphic.

Ans. (Complete). Define a homomorphism φ : Z15 → Z5 ⊕ Z3 , φ(k) = (k mod 5, k
mod 3).
Then φ is a homomorphism since
φ(a + b) = (a + b mod 5, a + b mod 3) = (a mod 5, a mod 3) + (b mod 5, b mod 3) =
φ(a) + φ(b), and φ(−a) = −φ(a).
Let k ∈ Ker(φ), then 5 | k and 3 | k so GCD(5, 3) = 15 | k and k = 0 in Z15 . Thus φ is
1-1, but |Z15 | = |Z5 ⊕ Z3 | = 15 so φ is an isomorphism.
Or We accepted the less complete answer that both Z15 and Z5 ⊕ Z3 are cyclic groups,
the latter since GCD(5, 3) = 1, hence they are isomorphic since there is a unique cyclic
group of given order, up to isomorphism. What underpins this second answer is the
above complete proof.

9
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

10. Let G be a group satisfying |G| = 75. Assume that G has a cyclic normal subgroup N of
order 25, generated by n.

(a) Denote by Aut(N ) the group of all isomorphisms β: N → N . Show that Aut(N ) ∼
= Z20 .
Ans. By theorem Aut(Z25 ) ∼
= U (25) acting by multiplication, and we have U (25) ∼
=
∼
Z20 = Z4 ⊕ Z5 .

(b) Let H be a subgroup of G having order 3, generated by an element h. Assume that

hnh−1 = n. Show that this implies that G = H ⊕ N is a direct sum.
Ans Also H ∩N = e, since |H ∩N | divides |H| = 3 and |N | = 25 and GCD(|H|, |N |) = 1.
Since N is assumed cyclic, and H must be cyclic, having order 3, we have h · nk · h−1 =
(h · n · h−1 )k = nk , and h2 · nk · h−2 = h · (h · nk · h−1 ) · h−1 = hnk h−1 = nk , showing that
H commutes with N , implying HN = G. This shows G = H ⊕ N .

(c) Let H =< h > be a subgroup of G having order 3. Show that, indeed, hnh−1 = n (this
was assumed in part (b). Now you are asked to prove it).
Steps: First show that hnh−1 ∈ N , so hnh−1 = nk for some k. Then show k = 1, by
considering the homomorphism θ : H → Aut(N ) given by θ(ht ) ◦ (ni ) = ht · ni · (ht )−1 .
Hint: Consider the orders of θ(H), H, and Aut(N ).
Ans. Since N is normal, hnh−1 ∈ N and θ defines an automorphism of N . Since θ(H)
is a quotient group of H and also a subgroup of Aut(N ), the order |θ(H)| divides both
|H| and |Aut(N ), so divides GCD (3,20)=1, so θ(H) = e (see also problem # 13B). This
means hnh−1 = n.

10
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

11. Let G be a group of order |G| = 125 acting on a set X with |X| = 100.

(a) What are the possible sizes of the orbits of this action?
Ans. The size of an orbit divides |G| = 125, and is no larger than |X| = 100 so can be
1,5, or 25. (we accepted also 125 here).

(b) Prove: if the action of G on X has one fixed point then it must have at least 5 fixed
points.
Ans We have |X| = |X G | + |Xi | where X G is the fixed points and the Xi are the
P
larger orbits. But X is a multiple of 5, and the orders of the larger orbits are 5 or 25.
So 5 divides |X G |. If X G 6= ∅ it has at least 5 elements.

(c) Prove that any action of G on X has at least 2 orbits.

Ans Since the sizes of orbits are 1,5, or 25 and 100 is a multiple of 25, we obtain the
smallest number of orbits when the action of G on X has 4 orbits of 25 elements each.

11
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

12. Recall that the group G = D4 of symmetries of the square X with vertices A, B, C, D acts
on the set S = {AB, BC, CD, DA} of sides of X, as well as on the set D = {AC, BD} of
diagonals of X.

(a) Determine the stabilizer H = StabG (AB) of AB, and the orbit of AB in S.
Ans H = StabG (AB) = (e, (AB)(CD)). The powers of τ = (ABCD) take AB to the
other sides so the orbit of AB is S. These satisfy |G| = |StabG (AB)| · #{orbit of AB}.

(b) Write the stabilizer StabG (DA) as a conjugate of H.

Ans. Since τ −1 (AB) = DA, we have StabG (DA) = τ −1 Hτ.

(c) Determine whether StabG (AB) is a normal subgroup of D4 . Explain your answer.
Ans. No, since the conjugate StabG (DA) = τ −1 Hτ 6= H, as (AD)(BC) ∈ StabG (DA)
but is not in H.

(d) Determine the stabilizer W = StabG (AC) of AC in D. Is it a normal subgroup of G.

Why or why not?
Ans W = (e, τ 2 , (AC), (BD)) satisfies |D4 | = 2|W |, so is normal in D4 (see # 6a, proof
(i)).
Or: StabG (BD) = W (by inspection). Since all conjugates of W are W itself, W is
normal in G = D4 .
Note: When G acts on a set S, the conjugates of a stabilizer H of s ∈ S are exactly the
stabilizers of the elements in the orbit of s.

12
MTH 3175 Group Theory Spring 2011 FE - Prof. Iarrobino and Prof. Todorov

13. You will be credited with either (13A) or (13B) but not both.

13A. The dihedral group D6 acts on the set X = K 6 of colorings of the edges of the regular
hexagon with a set K of n colors. Determine how many different-colored hexagons can
be made with (up to) n given colors. Two colorings are considered the same if the first
colored hexagon can be moved in space so that it is congruent to the second.
13B. Let ϕ : G → W be a homomorphism of groups and denote by ϕ(G) the image of ϕ.
i. Let g ∈ G. Show that the order |ϕ(g)| divides |g|.
ii. Show that |ϕ(G)| divides GCD (|G|, |W |).

Ans 13A. Let the Hexagon have vertices {A, B, C, D, E.F }, and let τ = (ABCDEF ). Then
5 2 4
|X e | = n6 ; and |X τ | = |X (τ ) | = n as all sides must be the same color. But |X (τ ) | = |X (τ ) | =
3
n2 , since every other side must be colored the same. |X (τ ) | = n3 since sides AB, BC, CD may
each have one of n different colors. For a flip as f = fAD = (CE)(BF ) about the diagonal
(AD), |X f | = n3 as again sides AB, BC, CD each may have one of n colors. Finally the the
three flips like fv = (CD)(BE)(AF ) with axes the perpendicular to two opposite sides, have
|X fv | = n4 , since for fv the sides CD, AF , AB, BC may each have one of n different colors,
By Burnside theorem we have

# orbits v = (n6 + 3n4 + 4n3 + 2n2 + 2n) /12

Ans 13B. First proof of (i). Let k = |g|, then g k = e. This implies (ϕ(g))k = ϕ(v k ) =
ϕ(eG ) = eW . This implies |ϕ(v)| divides k.
Second Proof of i. By restricting ϕ to H = hgi, we have |ϕ(g)| = |ϕ(H)| and |H| = |KH | ·
|ϕ(H)| where KH is the kernel of ϕ on H (since ϕ(H) ∼
= H/KH ). Thus |ϕ(g) divides |g| = |H|.

Proof of (ii). Since ϕ(G) ⊂ W is a subgroup of W , |ϕ(G) | |W |. Let K be the kernel of ϕ:

since G/K ∼ = ϕ(G) we have G = |K| · |ϕ(G)| so |ϕ(G)| | |G|. Thus |ϕ(G)| divides
GCD (|G|, |W |).

Sylow: Let |G| = pn ·m with GCD(p, m) = 1 and rp = #{Sylow p-subgroups}. Then rp ≡ 1(mod p), and
rp |m. P 
Burnside: # orbits v = |S g | /|G|, where S g = |F ix(g)|.
g∈G
U (p ) = Z k k−1 for p an odd prime. U (2k ) ∼
k ∼
p −p = Z k−2 ⊕ Z2 for k > 1.
2

13