1
a
Let . Then, is a bijection and a homomorphism. Thus, it is an isomorphism. An identity exists, and associativity follows from the associativity of function composition. If , is also an isomorphism, and hence is in .
b
An automorphism must map a generator to a generator. For , the generators are the set of numbers less than and coprime to . Thus, .
c
Let . Note that every element in has order 2.
d
is generated by and . Note that any automorphism will map to and to (since -1 is the only element with order 2). The rest of the elements are of order 4.
1 | -1 | ||||||
---|---|---|---|---|---|---|---|
fixed | fixed |
Consider the pairs . If maps to one of , cannot map to one of . Thus, the total number of automorphisms is . The leaves us with the choices , , and . One can find at least three elements of order 3 in , such as , , and . is the only group with 3 or more elements of order 3.