The following problems test understanding across all major topics. Full solutions are provided; Each problem includes a cross-reference to the relevant section for review.
Problem 1. Let G be a group and g∈G an element of order n. Prove that ∣gk∣=n/gcd(n,k).
Solution
Solution. Let d=gcd(n,k) and write n=dn", k=dk′ with gcd(n′,k′)=1. We show (gk)n′=e and that n′ is the smallest such positive exponent.
(gk)n′=gkn′=gdk′n′=gn′k. Since n=dn′We have gkn′=gdk′n′=(gdn′)k′=ek′=e. So ∣gk∣ divides n′=n/d.
Conversely, if (gk)m=gkm=eThen n divides kmSo dn′ divides dk′m Hence n′ divides k′m. Since gcd(n′,k′)=1We get n′ divides m. Thus ∣gk∣=n′=n/gcd(n,k). ■
If you get this wrong, revise: Section 1.6, Proposition 1.5; Section 2.4, Theorem 2.5.
Problem 2. Show that D4 has exactly five subgroups of order 2 and determine which are normal.
Solution
Solution.D4={e,r,r2,r3,s,rs,r2s,r3s} where r4=e, s2=e, srs=r−1.
Elements of order 2: r2, s, rs, r2s, r3s. So there are five subgroups of order 2: ⟨r2⟩, ⟨s⟩, ⟨rs⟩, ⟨r2s⟩, ⟨r3s⟩.
For normality: rr2r−1=r2 and sr2s=r−2=r2So ⟨r2⟩⊴D4. But s(rs)s=sr=r−1s=r3s∈/⟨rs⟩So ⟨rs⟩ is not normal. Similarly, the other reflection subgroups are not normal. Only ⟨r2⟩=Z(D4) is normal. ■
If you get this wrong, revise: Section 1.3, 1.7; Section 4.1, Proposition 4.1.
Problem 3. Let H,K≤G. Prove that H∩K≤G.
Solution
Solution.H∩K is non-empty since e∈H and e∈KSo e∈H∩K. If a,b∈H∩KThen a,b∈H and a,b∈K. Since H and K are subgroups, ab−1∈H and ab−1∈KSo ab−1∈H∩K. By the subgroup criterion, H∩K≤G. ■
If you get this wrong, revise: Section 2.1, Theorem 2.1; Section 2.6, Theorem 2.6.
Problem 4. Find all subgroups of Z/12Z and draw the subgroup lattice.
Solution
Solution. By Theorem 2.4, every subgroup of the cyclic group Z/12Z is cyclic, And there is exactly one subgroup of order d for each divisor d of 12.
The divisors of 12 are 1,2,3,4,6,12. The subgroups are: ⟨0⟩={0} (order 1), ⟨6⟩={0,6} (order 2), ⟨4⟩={0,4,8} (order 3), ⟨3⟩={0,3,6,9} (order 4), ⟨2⟩={0,2,4,6,8,10} (order 6), ⟨1⟩=Z/12Z (order 12).
The subgroup lattice (Hasse diagram): Z/12Z connects to ⟨2⟩, ⟨3⟩, ⟨4⟩. ⟨2⟩ connects to ⟨4⟩ and ⟨6⟩. ⟨3⟩ connects to ⟨6⟩. ⟨4⟩ and ⟨6⟩ connect to {0}. ■
If you get this wrong, revise: Section 2.4, Theorem 2.4; Section 1.7.
Problem 5. Let H=⟨(1234)⟩≤S4. Find all left cosets of H in S4 and verify H is not normal.
Solution
Solution.H={e,(1234),(13)(24),(1432)} has order 4[S4:H]=6. Choose representatives from S4∖HE.g., (12), (13)(23), (123), (132). The six cosets are: H, (12)H, (13)H, (23)H, (123)H, (132)H.
To show H is not normal: (12)(1234)(12)=(2134)=(1342)∈/H (since (1342) is not among the four elements of H listed above). ■
If you get this wrong, revise: Section 3.1, 3.4; Section 4.1.
Problem 6. Prove that if [G:H]=2Then H⊴G.
Solution
Solution. Since [G:H]=2There are exactly two left cosets: H and gH for some g∈/H. These partition GSo gH=G∖H. Similarly, the two right cosets are H and Hg And Hg=G∖H. Therefore gH=Hg for all g∈G. For h∈H: hH=H=Hh. For g∈/H: gH=G∖H=Hg. Thus gH=Hg for all g∈GSo H⊴G. ■
If you get this wrong, revise: Section 3.5, Corollary 3.7.
Problem 7. Compute Q8/{1,−1} and identify the quotient group up to isomorphism.
Solution
Solution.Q8={1,−1,i,−i,j,−j,k,−k} with ∣Q8∣=8 and Z(Q8)={1,−1} of order 2. The quotient has order 4. The cosets are Z={1,−1}, iZ={i,−i}, jZ={j,−j}, kZ={k,−k}. Every non-identity element satisfies (iZ)2=i2Z=(−1)Z=ZSo every element has order 1 or 2. The quotient is abelian (since Z(Q8) contains the commutator subgroup). Thus Q8/Z(Q8)≅V4≅Z/2Z×Z/2Z. ■
If you get this wrong, revise: Section 4.2, 4.3; Section 5.3, Theorem 5.3.
Problem 8. Let ϕ:Z→Z be defined by ϕ(n)=3n. Determine whether ϕ is a group homomorphism, find its kernel and image, and explain why it is not a ring homomorphism.
Solution
Solution. As a group homomorphism (Z,+)→(Z,+): ϕ(m+n)=3(m+n)=3m+3n=ϕ(m)+ϕ(n). ✓ ker(ϕ)={n∈Z:3n=0}={0}. im(ϕ)=3Z={3k:k∈Z}.
ϕ is NOT a ring homomorphism because ϕ(1)=3=1. Ring homomorphisms between rings with unity must send 1 to 1. ■
If you get this wrong, revise: Section 5.1, Proposition 5.1; Section 8.6, Proposition 8.6.
Problem 9. State and prove the correspondence theorem (fourth isomorphism theorem).
Solution
Solution.Theorem. Let ϕ:G→H be a surjective homomorphism with K=ker(ϕ). Then there is an inclusion-preserving bijection between subgroups of G containing K and Subgroups of HGiven by U↦ϕ(U) with inverse V↦ϕ−1(V). Normality and indices are preserved.
Proof. Define Φ(U)=ϕ(U) and Ψ(V)=ϕ−1(V). Φ(Ψ(V))=ϕ(ϕ−1(V))=V since ϕ is surjective. Ψ(Φ(U))=ϕ−1(ϕ(U))=U since K⊆U. For normality: U⊴G⇔ϕ(U)⊴H (by conjugation argument). For indices: [G:U]=[H:ϕ(U)] (since ∣G/U∣=∣H/ϕ(U)∣ via the induced map). ■
If you get this wrong, revise: Section 5.7, Theorem 5.6.
Class equation: ∣S4∣=1+6+8+3+6=24. ✓ Z(S4)={e}So ∣Z(S4)∣=1And the sum of [S4:CG(xi)] over non-central classes is 6+8+3+6=23. ■
If you get this wrong, revise: Section 6.4, Theorem 6.4; Section 1.4.
Problem 11. Let G act transitively on a set X with ∣X∣=p (prime). Prove that G has a subgroup of index p.
Solution
Solution. Let x∈X. Since G acts transitively, ∣Orb(x)∣=∣X∣=p. By the orbit-stabilizer theorem, [G:Stab(x)]=pSo Stab(x) has index p in G. Since Stab(x) is a subgroup (Proposition 6.1), we are done. ■
If you get this wrong, revise: Section 6.2, Theorem 6.2.
Problem 12. Find all Sylow 2-subgroups of S3.
Solution
Solution.∣S3∣=6=2⋅3. Sylow 2-subgroups have order 2. n2≡1(mod2) and n2 divides 3So n2∈{1,3}. The elements of order 2 in S3 are the three transpositions: (12), (13), (23). Each generates a subgroup of order 2: ⟨(12)⟩, ⟨(13)⟩, ⟨(23)⟩. So n2=3 and the three Sylow 2-subgroups are these. ■
If you get this wrong, revise: Section 7.1, 7.6; Theorem 7.3.
Problem 13. Prove that every group of order 15 is cyclic.
Solution
Solution.∣G∣=15=3⋅5. By Sylow’s third theorem: n5≡1(mod5) and n5 divides 3So n5=1. n3≡1(mod3) and n3 divides 5So n3=1.
Both the Sylow 3-subgroup P≅Z/3Z and the Sylow 5-subgroup Q≅Z/5Z are normal. Since P∩Q={e} (their orders are coprime) And ∣PQ∣=∣P∣∣Q∣/∣P∩Q∣=15=∣G∣We have G=PQ. Since both are normal with trivial intersection, G≅P×Q≅Z/3Z×Z/5Z≅Z/15Z. ■
If you get this wrong, revise: Section 7.3, Proposition 7.4; Section 7.7, Proposition 7.6.
Problem 14. Let G be a group of order 21=3⋅7. Show that G has a normal Sylow 7-subgroup. Must G be abelian?
Solution
Solution.n7≡1(mod7) and n7 divides 3. Since 7∤(3−1)We must have n7=1. So the Sylow 7-subgroup Q≅Z/7Z is normal.
n3≡1(mod3) and n3 divides 7So n3∈{1,7}. If n3=1Both Sylow subgroups are normal and G≅Z/21Z (abelian). If n3=7, G is a semidirect product Z/7Z⋊Z/3Z Which is non-abelian. This group exists: it is the unique non-abelian group of order 21. So G need not be abelian. ■
If you get this wrong, revise: Section 7.3, 7.7; Theorem 7.3.
Problem 15. Prove that (2) is a prime ideal of Z but (4) is not prime.
Solution
Solution. By Theorem 9.3, (p) is prime in Z iff Z/(p) is an integral domain. Z/(2)≅Z/2Z is a field, hence an integral domain, so (2) is prime.
Z/(4): we have [2][2]=[4]=[0] but [2]=[0]. So Z/(4) has zero divisors and is not an integral domain. Therefore (4) is not prime. ■
If you get this wrong, revise: Section 9.3, Theorem 9.3; Section 8.4.
Problem 16. Show that x2+1 is irreducible in R[x] but reducible in C[x].
Solution
Solution. In R[x]: suppose x2+1=(x+a)(x+b) with a,b∈R. Then a+b=0 and ab=1So −a2=1Giving a2=−1Which has no real solution. Thus x2+1 is irreducible in R[x].
In C[x]: x2+1=(x+i)(x−i). ■
If you get this wrong, revise: Section 10.2; Section 12.7, Fundamental Theorem of Algebra.
Problem 17. Use the Euclidean algorithm to find gcd(x3−2x+1,x2−1) in Q[x].
Solution
Solution.
x3−2x+1=x(x2−1)+(−x+1)
x2−1=(−x−1)(−x+1)+0
Since the last non-zero remainder is −x+1We have gcd(x3−2x+1,x2−1)=x−1 (up to multiplication by a unit in Q[x]I.e., a non-zero constant). ■
If you get this wrong, revise: Section 10.1, Theorem 10.1; Section 11.1.
Problem 18. Prove that Z[x] is a UFD but not a PID.
Solution
Solution.UFD: By Gauss’s lemma, since Z is a UFD, Z[x] is a UFD.
Not a PID: The ideal I=(2,x)={2f+xg:f,g∈Z[x]} is not principal. Suppose I=(h) for some h∈Z[x]. Then h divides both 2 and x. Since h divides 2∈Z, h is a constant polynomial, say h=c∈Z. Then (c)=(2,x)So c divides 2 and c divides xHence c=±1. But (1)=Z[x]=(2,x) since 1∈/(2,x) (every element of (2,x) has even constant term). Contradiction. Therefore (2,x) is not principal, and Z[x] is not a PID. ■
If you get this wrong, revise: Section 11.3, Theorem 11.3; Section 8.1.
Problem 19. Compute [Q(2,3):Q] and find the Galois group.
Solution
Solution. First, [Q(2):Q]=2 since x2−2 is irreducible over Q (by Eisenstein with p=2). Then 3∈/Q(2) (if 3=a+b2 With a,b∈QSquaring gives 3=a2+2b2+2ab2Forcing ab=0 and leading to contradiction). So [Q(2,3):Q(2)]=2.
By the tower law: [Q(2,3):Q]=2⋅2=4.
The Galois group consists of four automorphisms determined by their action on 2 and 3: id: 2↦2, 3↦3σ: 2↦−2, 3↦3τ: 2↦2, 3↦−3στ: 2↦−2, 3↦−3
Since all non-identity elements have order 2, Gal(Q(2,3)/Q)≅V4. ■
If you get this wrong, revise: Section 12.1, Proposition 12.1; Section 13.1.
Problem 20. Prove that a quotient ring R/I is an integral domain if and only if I is a prime ideal.
Solution
Solution. (⇒) Suppose R/I is an integral domain. Let ab∈I. Then (a+I)(b+I)=ab+I=0+I The zero element of R/I. Since R/I has no zero divisors, either a+I=0+I or b+I=0+I I.e., a∈I or b∈I. So I is prime.
(⇐) Suppose I is prime. R/I is a commutative ring with unity (since R is). If (a+I)(b+I)=0+IThen ab∈ISo a∈I or b∈I (since I is prime). Thus a+I=0+I or b+I=0+IMeaning R/I has no zero divisors. Also 1+I=0+I since I=R. Therefore R/I is an integral domain. ■
If you get this wrong, revise: Section 9.2, 9.3, Theorem 9.3; Section 8.4.
Problem 21. Let G be a finite group acting on a finite set X. Prove Burnside’s lemma: The number of orbits equals ∣G∣1∑g∈G∣Fix(g)∣.
Solution
Solution. Let S={(g,x)∈G×X:g⋅x=x}. Count ∣S∣ in two ways.
Grouping by g:∣S∣=∑g∈G∣{x∈X:g⋅x=x}∣=∑g∈G∣Fix(g)∣.
Grouping by x:∣S∣=∑x∈X∣Stab(x)∣.
For each orbit OEvery x∈O has ∣Stab(x)∣=∣G∣/∣O∣ (by orbit-stabilizer). So ∑x∈O∣Stab(x)∣=∣O∣⋅∣G∣/∣O∣=∣G∣.
Summing over all orbits: ∣S∣=∣G∣⋅(numberoforbits).
Combining: ∑g∈G∣Fix(g)∣=∣G∣⋅(numberoforbits). ■
If you get this wrong, revise: Section 6.3, Theorem 6.3.
Problem 22. Show that A5 is the smallest non-abelian simple group.
Solution
Solution. We show that every non-abelian group of order n<60 is not simple.
Order 6: S3 has normal subgroup A3.
Order 8: all groups of order p3 have non-trivial center (Theorem 6.5).
Order 10: n5=1 by Sylow.
Order 12: n3=1 or 4. If n3=4One checks A4 has the normal Klein subgroup V4.
Order 14: n7=1 by Sylow.
Order 15: n5=1, n3=1 by Sylow.
Order 18: n3=1 by Sylow (since n3≡1(mod3) and n3 divides 2).
Order 20: n5=1 by Sylow (since n5≡1(mod5) and n5 divides 4).
Order 21: n7=1 by Sylow.
Order 22: n11=1 by Sylow.
Order 24: if G is simple, n2≥3 and n3≥4. Counting elements gives a contradiction.
Order 26: n13=1.
Order 27: p-group has non-trivial center.
Order 28: n7=1 by Sylow (since n7≡1(mod7) and n7 divides 4).
Order 30: n5=1 or n3=1 by counting arguments (see Section 7.6).
Order 33: n11=1.
Order 34: n17=1.
Order 35: n7=1, n5=1.
Order 36: n3=1 or 4. If n3=4The action on Sylow 3-subgroups gives a homomorphism G→S4 whose kernel is a proper normal subgroup.
Orders 38,39,40,42,44,46,48,50,51,52,54,55,56,57,58: similar arguments apply. For each, either a Sylow subgroup is unique, or counting arguments force a normal subgroup.
A5 has order 60 and is simple (Proposition 14.2). Therefore it is the smallest non-abelian simple group. ■
If you get this wrong, revise: Section 7.7, Proposition 7.7; Section 14.3, Proposition 14.2.
Problem 23. Prove that the quotient ring Z[x]/(x2+1) is isomorphic to Z[i].
Solution
Solution. Define ϕ:Z[x]→Z[i] by ϕ(f(x))=f(i). This is a ring Homomorphism (evaluation at i). It is surjective: any a+bi∈Z[i] equals ϕ(a+bx).
The kernel consists of polynomials f∈Z[x] with f(i)=0. Since x2+1 is the minimal Polynomial of i over QEvery such f is divisible by x2+1 in Q[x]. By Gauss’s lemma, f is divisible by x2+1 in Z[x] as well. So ker(ϕ)=(x2+1).
By the ring isomorphism theorem, Z[x]/(x2+1)≅Z[i]. ■
If you get this wrong, revise: Section 9.2, Theorem 9.2; Section 8.6.
Problem 24. Let F be a field and let f∈F[x] be irreducible of degree n. Show that the Quotient ring F[x]/(f) is an n-dimensional vector space over F with basis {1,xˉ,xˉ2,…,xˉn−1}.
Solution
Solution. Since f is irreducible and F[x] is a PID, (f) is a maximal ideal, so E=F[x]/(f) is a field. Write xˉ=x+(f)∈E. Every element of E is a coset g(x)+(f) for some g∈F[x].
By the division algorithm, g=qf+r where deg(r)<n or r=0. Then g+(f)=r+(f) So every element of E can be written as r(xˉ)=a0+a1xˉ+⋯+an−1xˉn−1 With ai∈F. This representation is unique: if ∑i=0n−1aixˉi=∑i=0n−1bixˉi Then ∑(ai−bi)xˉi=0So ∑(ai−bi)xi∈(f)Meaning f divides a polynomial Of degree <n=deg(f)Which forces all ai−bi=0.
Therefore {1,xˉ,…,xˉn−1} is a basis for E over FAnd [E:F]=n. ■
If you get this wrong, revise: Section 10.1, Theorem 10.1; Section 12.3, Theorem 12.4.
Problem 25. Classify all finite fields of order pn for p=2 and n≤4.
Solution
Solution. By Theorem 12.5, for each prime power there is a unique (up to isomorphism) finite field.
F2 (2 elements): {0,1}. Arithmetic modulo 2.
F4 (4 elements): F2[x]/(x2+x+1). Elements: {0,1,α,1+α} where α2=α+1. Multiplicative group is cyclic of order 3: α3=1.
F8 (8 elements): F2[x]/(x3+x+1). Elements: {a+bα+cα2:a,b,c∈F2} Where α3=α+1. Multiplicative group is cyclic of order 7.
F16 (16 elements): F2[x]/(x4+x+1). Elements: {a0+a1α+a2α2+a3α3:ai∈F2} Where α4=α+1. Multiplicative group is cyclic of order 15.
Note: F4 is NOT a subfield of F8 (since 4 does not divide 8), but F4 IS A subfield of F16 (since 4 divides 16). More generally, Fpm⊆Fpn If and only if m divides n. ■
If you get this wrong, revise: Section 12.4, Theorem 12.5; Section 12.6.