**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 .

**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 .

**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:

, ,

**13) Show that the invariant factors of are gcd(m,n) and lcm(m,n) if and if .
Proof-** First assume that . We can factor m and n so that and where is prime and . Then and where and . Then we have:

.

Now we have it written as elementary divisors. To get the invariant factors we follow the algorithm and arrange the primes as follows: 2 rows because at most a prime can appear twice, r rows for r primes.

Then we multiply across as before. However here we note that the multiplication is just:

So these are the invariant factors. Thus we have:

. Note that the gcd always divides the lcm so that this is written in terms of invariant factors. If instead the gcd(m,n) = 1 then we have where so the invariant factor of is mn.