Next: Coding Theory and Cryptography
Up: Algebra
Previous: Outline
- 1.
- Groups
- (a)
- Isomorphism Theorems. Let M and N be normal subgroups of G such that
G=MN. Prove that
is isomorphic to
.
- (b)
- Sylow theorem. Prove that if |G|=132 then G is not simple.
- (c)
- Groups actions. Suppose |G|=pa, where p is a prime. Prove that every
subgroup of index p is normal in G.
- (d)
- Cauchy-Frobenious-Burnside lemma. If there are q colors available, prove
that there are
(qn2+2q[(n2+3)/4]+q[(n2+1)/2])/4 distinct
colored chessboads.
- (e)
- Linear groups. Let K be a field. Prove that GL(n,K) is a semidirect product of SL(n,K) by
.
- (f)
- Split extension. Construct a non-abelian group of order 75.
- (g)
- Solvable groups. Suppose |G|=pq, where p and q are primes. Prove that G is solvable.
- (h)
- Finitely generated abelian groups. Let
.
Find the number of elements of order 2 in G.
- 2.
- Rings.
- (a)
- Polynomial rings. Let f(x) be a polynomial in F[x], where Fis a field. Prove that
F[x]/(f(x)) is a field if and only if f(x) is
irreducible.
- (b)
- Euclidean domains. Prove that the quotient ring Z[i]/I is finite for any
nonzero ideal I of Z[i]. (Z[i] is the ring of Gausian integers).
- (c)
- Principal ideal domains. Let
be an ideal of
.
Prove that I is not a principal ideal of
.
- (d)
- Unique factorization domains. Determine all the representations of the inte
ger
as a sum of two squares.
- 3.
- Fields.
- (a)
- Galois Theory and construction of Galois groups. Determine the Galois group
of x4+4x-1.
- (b)
- Finite fields. Write out the multiplication table for F4 (the field of 4
elements).
- (c)
- Algebraic extensions. Prove that [
,
where Q is
the field of rational numbers.
Next: Coding Theory and Cryptography
Up: Algebra
Previous: Outline
Math Dept Webmaster
2003-08-28