Isomorphism and Generators in Z sub P

  • Thread starter Thread starter PennState666
  • Start date Start date
  • Tags Tags
    Isomorphism Prime
PennState666
Messages
18
Reaction score
0

Homework Statement


Let P be a prime integer, prove that Aut(Z sub P) ≈ Z sub p-1


Homework Equations



none

The Attempt at a Solution


groups must preserve the operation, be 1-1, and be onto and they can be called an isomorphism. Z sub p-1 has one less element in it so and all the elements in them are the same except for the one less element. Not sure what this tells me though. HELP ME FOR LINEARRRRR
 
Physics news on Phys.org
Let f be an automorphism of Z_p, and x a generator for Z_p, so that <x>=Z_p. Explain why f is determined by what it does to x, i.e. why knowing f(x) suffices to to know where f sends any other element of the group.

Now think about whether (x is a generator) => (f(x) is a generator) is true. You will see that Aut(Z_p) is isomorphic to the group of units of Z_p -- there is a natural isomorphism. Think how you can prove that the latter is cyclic.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top