Does Z*(n) always have a generator?

[dumbQuestion]

Hey this question is going to sound really basic and dumb but I'm new to abstract algebra and not very good at this stuff. When I am talking about Z*(n), to be clear, I mean the multiplicative group of integers mod n, or the way I'm always thinking about it, the units of Z(n). (I'm not sure what the actual name for Z(n) is, but it's the equivalence classes of the integers mod n, so for example, Z(3) = {[0],[1],[2]}, Z(4) = {[0],[1],[2],[3]}, etc.)

Now, it seems like Z*(n) always has some generator. But I don't want to just assume that's the case. I understand that Z*(n) is cyclic, but does every cyclic group have a generator? (or is this just part of the definition of being cyclic - that it's a group built up by some generator) Is there a theorem that says Z*(n) is cyclic? Also, how can I tell how many generators of Z*(n) there are? For example when I'm building up Dirichlet tables for Z*(n) I notice for example Z*(5) has two generators: [2] and [3], while some of the others only have a single generator. Is there any theorem that tells me exactly how many generators there are?

 

[micromass]

Hey this question is going to sound really basic and dumb but I'm new to abstract algebra and not very good at this stuff. When I am talking about Z*(n), to be clear, I mean the multiplicative group of integers mod n, or the way I'm always thinking about it, the units of Z(n). (I'm not sure what the actual name for Z(n) is, but it's the equivalence classes of the integers mod n, so for example, Z(3) = {[0],[1],[2]}, Z(4) = {[0],[1],[2],[3]}, etc.)

Now, it seems like Z*(n) always has some generator. But I don't want to just assume that's the case. I understand that Z*(n) is cyclic, but does every cyclic group have a generator? (or is this just part of the definition of being cyclic - that it's a group built up by some generator)

A cyclic group is by definition a group with a generator.

Is there a theorem that says Z*(n) is cyclic?

No, because it's not true. Take \mathbb{Z}^*(8)=\{1,3,5,7\}. Then we have that 3^2=5^2=7^2=1. So there is no generator.

However, when n is a prime number, then it is true. In general, if you have a field, then every finite, multiplicative subgroup of the field is cyclic. Some proofs can be found here: http://mathoverflow.net/questions/5...multiplicative-subgroups-of-fields-are-cyclic

Also, how can I tell how many generators of Z*(n) there are? For example when I'm building up Dirichlet tables for Z*(n) I notice for example Z*(5) has two generators: [2] and [3], while some of the others only have a single generator. Is there any theorem that tells me exactly how many generators there are?

If you have a cyclic group of order k, let's say \{e,g,g^2,...,g^k\}. Then one can prove that the order of an element g^tis equal to \frac{k}{gcd(k,t)}. So the number of generators of the group is equal to the number of t such that gcd(k,t)=1. This number is denoted by \varphi(t)-1 and is called the Euler totient function.

In the case of \mathbb{Z}^*(n). If n is a prime, then this is cyclic with order n-1. So the number of generators is given by \varphi(n-1)-1.
http://en.wikipedia.org/wiki/Euler's_totient_function

 

[dumbQuestion]

THank you so much. I did not realize that Z^{*}(n) was not cyclic and feel kind of stupid now for thinking it (always) was.

And wow... thank you more than you know for letting me know about that relationship between the Euler totient function and the number of generators of a cyclic group. This is extremely helpful!

 

[dumbQuestion]

Wait... I'm confused about one thing. How can the order of every element a in a cyclic group be, t/gcd(k,t) where k is the order of the group and a = g^t for a generator g. The reason I ask is because gcd(k,1) = 1, and so that makes it sound like the order of 1 will be t, which would make it a generator, but it's never a generator. I imagine that's why you're subtracting the 1, but I was just wondering if you could clarify which theorem you were pointing to to get that because again I'm confused why it makes it look like the identity is a generator.

 

[micromass]

Wait... I'm confused about one thing. How can the order of every element a in a cyclic group be, t/gcd(k,t) where k is the order of the group and a = g^t for a generator g. The reason I ask is because gcd(k,1) = 1, and so that makes it sound like the order of 1 will be t, which would make it a generator, but it's never a generator. I imagine that's why you're subtracting the 1, but I was just wondering if you could clarify which theorem you were pointing to to get that because again I'm confused why it makes it look like the identity is a generator.

OK, but I'm working in the cyclic groups \{1,g,g^2,...,g^{k-1}\}. So I have that 1=g^0, so t=0. So the order of 1 is k/gcd(k,0). It might not be very easy to see what gcd(k,0) is though. But we can also write 1=g^k. This makes it easier because then t=0 and the order is k/gcd(k,k)=k/k=1. Like expected.

This actually implies that the right definition of gcd(k,0) would be gcd(k,0)=k.

 

[dumbQuestion]

oooh ok that makes sense. Let me make sure I understand though. So say we are in Z*(n) and say we have a generator, say [2]. [2] being a generator means that [2][2]= some other element in Z*(n), and [2][2][2] yet another... all the way until we multiply n of them to get [2][2]...[2] (n times) = [1]. So [2]^n = 1, but [n]=[0], so is that why you are referring to using 0 instead?