**Example 1: How many non isomorphic abelian groups are there of order 1500?
Proof-** We have that . Using this we can list all families of elementary divisors, which are : . This gives that there are exactly 6 non isomorphic abelian groups of order 1500 since each set corresponds to a unique (up to isomorphism) abelian group of order 1500.

**Example 2: Find the invariant factors of .
Proof- **First we rewrite in terms of elementary divisors:

. Thus we have the elementary divisors being . Ordering them in the correct matrix formation we get:

Multiplying across gives us the invariant factors, which are .

**Hungerford 2.2.12:(a) What are the elementary divisors of the group . Do the same for .
Proof-** For the group we have that . Thus the elementary divisors are . To get the invariant factor we need only multiply the elementary divisors together because they are all relatively prime. Therefore the invariant factor is . Then we can say finally that the group .

In a similar manner we have the elementary divisors for are . Because we have 5 unique primes and 2 appearing the most amount of times, 4, we arrange the elementary factors into 4 rows and 5 columns ordering from least to greatest filling in with 0 powers where necessary:

Lastly, multiply across to get the invariant factors of . Thus we finally have:

.

**(b) Determine up to isomorphism all abelian groups of order 64 and 96.**

**Proof-** so we have the following abelian groups. , , , .

Next we have that so that any abelian group of that order is isomorphic to one of the following:

, ,

**Hungerford 2.2.9: How many subgroups of order does the abelian group have?
Proof-** By the classification theorem we know that if then or . So we first need to know how many unique subgroups of there are which are isomorphic to . Consider the elements in

Now we need to know which of these has order p. All elements that are multiples of p other than the identity, have order p. Consider an element , where . Then . If there was some such that we would have that which is a contradiction because . There are multiples of p and so there are elements of order p in .

Next we find the number of elements of order p in . In a similar manner we get that all multiples of have order p and that there are such elements in .

Lastly we need how many elements there are of the form which have order p. Note that . This can only happen in a few cases. If either order is 1, then the other must be p, or they can both be p. If , then x can be elements. In order for the least common multiple to be p we need that or . So each of the p-1 elements that x can be can be paired with the identity of y, giving p-1 choices. Then each of the p-1 elements that x can be can be paired with the p-1 choices of y, giving choices. Lastly if x is the identity it can be paired with p-1 more choices from y. This gives a total of elements of order p in . Note that has order and has elements of order p so that there can only be one subgroup of . There are not enough elements of order p to make up another subgroup.

Next we need to know how many unique subgroups there are of which are isomorphic to . To do this we need a lemma: If there are n elements of order d in a group G, then there are cyclic subgroups of order d, where is the Euler Phi function, which counts the number of positive integers relatively prime and less than the input number. Thus by the lemma it is enough to count the number of elements of order in . Again an element has order iff . This can only happen if either or . After an annoying counting argument we get that there are such elements so that by the lemma we have subgroups of type . Thus in total there are subgroups of order .

**Midterm #5: G an abelian group of order 252. Find all possible primes such that G can contain a subgroup isomorphic to \mathbb{Z}_p \bigoplus \mathbb{Z}_p$ for some prime p. Give an example where it doesn’t.**

Proof- By the classification theorem we can find all such groups G by listing out possible elementary divisors. which gives the possible elementary divisors to be:

. Writing them out in the correct way we can get invariant factors.

From this we can see the only possible primes are 2 and 3. As a counterexample, is cyclic and thus every subgroup is cyclic. Therefore it cannot contain a subgroup isomorphic to because that group is not cyclic.

**Hungerford 2.2.1: Show that a finite abelian group that is not cyclic contains a subgroup which is isomorphic to for some prime p.
Proof-** Let G be a finite abelian group. Then we have where is prime and is a positive integer. If every prime is distinct, then all the powers of the primes are relatively prime so that , which is cyclic. So instead we must have some case of . WLOG suppose that and call them both p. Then consider that where . Note that so that is a cyclic subgroup of . Since in the order of must divide p. This is only possible if which means is a cyclic subgroup of of order p, and thus isomorphic to . Then we have that is a cyclic subgroup of .

**Theorem 2.4.3: If a group G acts on a set S then , where is the orbit of x, and is the stabilizer subgroup of x.
Proof-** We can exhibit a bijection between the two sets which gives the cardinality to be the same. We have that, . This tells us that the association: is injective, and it is obviously surjective, so that the cardinalities are equal.

Hungerford 2.4.3: ** If a group G contains an element a having exactly 2 conjugates, then G has a proper normal nontrivial subgroup N.
Proof-** Let G be a group and let have exactly 2 conjugates. That is, there are 2 elements in the conjugacy class (orbit) of a. By theorem 4.3, , but by previous theorem this gives that is normal in G. If were to be trivial then that would mean that G has 2 elements so is the same as and so is abelian. But in an abelian group, every conjugacy class has 1 element so this is a contradiction. Thus is nontrivial and normal in G.

**October 2004 Qual #5 (Corollary 2.4.9): Let G be a finite simple group having a subgroup of index n. Show that G is isomorphic to a subgroup of .
Proof-** Let H be a subgroup of G with index n and define the group action of G on the set of left cosets: by . This is clearly a group action. Then we have the induced homomorphism: given by , where by . Now suppose that Then we have . In particular we have that it is true for , so that . This tells us that . Note t hat G is simple, so that the Kernel must be trivial since it is a subset of H. Now by the first isomorphism theorem we have . Note that since we have that . Thus .

**April 2004 #2: Let G be a group. If Aut(G) is cyclic then G is abelian.
Proof-** First recall that the inner automorphisms of G, denoted and that so that is also cyclic. If G acts on G by conjugation, then the induced homomorphism has and so that . This gives that is cyclic which tells us that G is abelian.

**2011 Qual #5: Suppose that H acts on a set S. Given define the H-orbit of s. Prove that if is another element then either is in the orbit of s or that the orbits of s and s’ are disjoint.
Proof-** Suppose that is not in the orbit of s, and suppose there is some . Then we can write . This tells us that is in the orbit of s which is a contradiction.

**2013 Qual #2(a) (Hungerford 2.4.6): Consider acting on the set by permutations. What is the orbit of i? What is the stabilizer of i? Prove that the stabilizer subgroup of any two elements of S are conjugate.
Proof-** Orbit of i:

Stabilizer of i: Claim that . First note that , which comes from the fact that . Consider as the set of permutations on . Then clearly these permutations fix i and are a subgroup isomorphic to .

Next, we show that is conjugate to . We know that for any i,j that exists such that \Rightarrow (ji) j = i$, since the inverse of (ij) is (ji). Claim that . Let . Then . Note that , while because . This gives that . Thus . Now let . Then we can write for some . Then . This tells us that . Thus we have subset inclusion so that the two sets are conjugate.