some short proofs on group theory 
Let $G=\{a_2, a_2, a_3...a_n\}$ be a finite abelian group of order $n$. Let $x=a_1 a_2 a_3...a_n$. Prove that $x^2=e$. 

My solution: Well since the order of the group is finite, we know the order of the elements of the group are also finite. So there exists a certain $k \in \mathbb{Z}$ such that $a^k = e$. Since the order the $n$, it must be that $k = n$. So since $x=a_1 a_2 a_3...a_n$ then $x^2 =(a_1 a_2 a_3...a_n)^2$ and because the group is abelian we have $x^2=a_1^2 a_2^2 a_3^2...a_n^2$ but $a^n = e$ and $n=2$ (DID I GO WRONG HERE??) then we must have $x^2 = eee...e = e$

Let $G$ be a group and let $a \in G$. Prove $\langle a\rangle = \langle a^{-1}\rangle$. 

I don't even know how to begin this one. I know the cyclic subgroup generated by $a$ is the set $\{a^n | n \in \mathbb{Z}\}$

Show that $U_5$ is isomorphic to $U_{10}$. 

Well both of these have order 4. 
Theorem: Every finite cyclic group of order n is isomorphic to $\mathbb{Z}$. 
I don't know how to apply the theorem to the units. 
General question: Are all unit groups ie, $U_5$ cyclic? 
 A: Your argument in the first part is very problematical. First, it is false that "because the group is of order $n$, it must be that $k=n$." For example, in the Klein $4$-group, which has order $4$, you have $x^2 = e$ for all $x$. You can certainly conclude that $n$ works, but you cannot conclude that $n$ is the only thing that works. 
Instead try this Hint: Pair each element with its inverse; if an is its own inverse, pair it with itself. Check what happens.
Question 2: In order to show that $\langle a\rangle = \langle a^{-1}\rangle$, it suffices to show that $a\in\langle a^{-1}\rangle$ and that $a^{-1}\in\langle a\rangle$. Why? Because $\langle x\rangle$ is the smallest subgroup of $G$ that contains $x$. So if $x\in H$ for any subgroup $H$ of $G$, then $\langle x\rangle\subseteq H$. So if you can prove that $a\in\langle a^{-1}\rangle$, then since $\langle a^{-1}\rangle$ is a subgroup, then you must have $\langle a\rangle\subseteq \langle a^{-1}\rangle$. Showing $a^{-1}\in\langle a\rangle$ will give the other inclusion.
Question 3: You are incorrect in your assertion that "every cyclic subgroup of order $n$ is isomorphic to $\mathbb{Z}$", but I suspect you meant $\mathbb{Z}_n$, not $\mathbb{Z}$.
There are two, and only two, groups of order $4$: the cyclic group of order $4$, and the Klein $4$-group. How can you tell them apart? Well, the cyclic group of order $4$ has an element of order $4$, but the Klein $4$-group does not. You know this group has order $4$. If all elements have order $1$ or $2$, then it's the Klein $4$-group. If there is at least one element of order $4$, then it's cyclic of order $4$.
(In general, if $G$ has order $n$, then $G$ is cyclic if and only if it has an element of order $n$). 
A: HINTS
1) inversion is bijection (permutation) on $\rm\:G\:,\:$ so $\rm\: G\ =\ \{a_1,a_2,\cdots,a_n\}\ =\ \{a_1^{-1},a_2^{-1},\cdots,a_n^{-1}\}\:.$ Hence taking the product of all elements both ways yields:
$\rm\quad\quad\quad x\ =\ a_1\cdots\: a_n\ =\ a_1^{-1}\cdots\: a_n^{-1}\ =\ (a_1\cdots\: a_n)^{-1}\: =\ x^{-1}\ \ \Rightarrow\ \ x^2\ =\ 1$ 
More generally see Wilson's theorem for groups.
2) $\rm\ \ a^{-1} \in \langle a\rangle\ $ and $\rm\ a \in \langle a^{-1}\rangle$
3) $\rm\ \ p\:$ odd $\rm\:\Rightarrow\ \phi(p)\ =\ \phi(2\:p)\:,\ $ i.e. $\rm\ p-1\ =\:$ the number of odd naturals below $\rm\:2\:p\:$ excluding $\rm\:p\:.$
A: Q1. For the first question, since $G$ is a group, each element $a_i$ has an inverse $a_i^{-1}$.  Note that inverses are unique.  Let $\{b_i\}_{i=1}^k$ denote the subset of elements of order $2$ (I.e., $b_i = b_i^{-1}$ for all $i$).  Hence,
$$
x^2 = (a_1 \dots a_n)^2 = (b_1 \dots b_k)^2 = b_1^2 \dots b_k^2 = e
$$
as $G$ is abelian.  I apologize that this argument is not as slick as possible, but I hope it gets the point across.  Feel free to accept any post that answers all three questions, by the way.  I will try to type up the other two, but someone will probably beat me to it.
A: *

*I do not see why you are making the assumption that $n = 2$, as that is only a special case of the theorem you are being asked to prove. The key here is to observe that $x$ is the product of ALL elements of $G$. For every $a_i$ there is an $a_j$ such that $a_j = a_i^{-1}$, and so if $i \neq j$ we can cancel $a_i$ and $a_j$ in $x$. We are then left with only elements that are their own inverses, and so $x^2 = e$.

*This follows from the fact that $-1$ is a unit in $\mathbb{Z}$, and so $\{x^n | n\in \mathbb{Z}\} = \{x^{-n} | n\in \mathbb{Z}\}$.

*Count the number of elements of $U_5$ and $U_{10}$, and check the orders of each elements. This should give you an answer.
