(1) Suppose and is nilpotent, then .

\begin{proof} Since is nilpotent, is a direct product of Sylow subgroups. Assume that where is the Sylow -subgroups and are distinct primes. It follows that where are Sylow -subgroups of .

Note that . If , then for all . By exercise (2) of HW3, for any with , we have that . It yields that , contradiction. Therefore, . \end{proof}

(2) Let be a nontrivial finite group.

  • (a) If is solvable, then it contains a nontrivial normal abelian subgroup.
  • (b) If is not solvable, then it contains a nontrivial normal subgroup such that .

\begin{proof} First, we claim that is a normal subgroup of for any . When , and each element in can be written as with . For any , and so . Assume that , then

For any and any , . As , we have that and so for any . Therefore, . By induction hypothesis, we can show that for all .

i) Since is solvable, there exists an such that and . It follows that and so is abelian.

ii) Since is non-solvable, the length of derived series of is infinite. Therefore, there exists such that and this is the desired . \end{proof}

(3) Any group of order ( are distinct primes) is solvable.

\begin{proof} Assume that . By the third Sylow theorem, and . It yields that and so has the unique Sylow -subgroup . Since is solvable by and is solvable, is also solvable.

Assume that . By the third Sylow theorem, and . It follows that . Similarly, we get . Assume that and . Since Sylow -subgroup is cyclic, has Sylow -subgroups yields that has elements of order . Hence, has elements of order , which contradicts with . Therefore, at least one of equals . If (rep. ), then has a solvable normal subgroup by being a -group (rep. -group). Further, note that is also solvable, it yields that is solvable. \end{proof}

(4) Is nilpotent? Show work.

\begin{proof} is not nilpotent.

Let . Since and , is of order and . As and for any non-identity , the center of is trivial. As each nilpotent group is a direct product of Sylow subgroups, its center is non-trivial. Therefore, is not nilpotent. \end{proof}

(5) Is nilpotent? Show work.

\begin{proof} is not nilpotent.

We claim that is trivial for any . Let . Then yields that . Since , there is and so .

Therefore, and is not nilpotent. \end{proof}

(6) For what is nilpotent? Show work.

\begin{proof} By Exercise (5), for , is nilpotent; for , is not nilpotent. \end{proof}