Re: Automorphism of prime order
- From: Jack Schmidt <Jack.Schmidt.SciMath@xxxxxxxxx>
- Date: Sat, 05 Apr 2008 18:03:38 EDT
crossedproduct wrote in http://mathforum.org/kb/thread.jspa?messageID=6165684
What's more, p must be an odd prime.
If |G| = 3, then Aut(G) contains an element
of order 2, whereas G itself does not.
Ah yes, p=q^n-1 prime implies that either q-1=1 or n=1. The first case
was q=2 as desired, but the second case still allows p=2, q=3.
Thanks to those who replied!
You're welcome. You often ask interesting questions, though it is hard
to see how they fit together. Some are standard exercise, some are
very non-standard exercises. Some seem to require only basic ideas,
some seem to require the classification of finite simple groups.
Is this an independent study, or a crash course on finite groups?
.
- Prev by Date: Re: Combinatorics question
- Next by Date: Re: Finite group, all of whose nonidentity elements have the same order
- Previous by thread: Re: Automorphism of prime order
- Next by thread: Giving structure of field to R3 over R
- Index(es):