Showing that a group isn't cyclic.

  • Thread starter Thread starter djxl
  • Start date Start date
  • Tags Tags
    Cyclic Group
djxl
Messages
5
Reaction score
0

Homework Statement



Show that \left( \mathbb{Z}/32\mathbb{Z}\right)^{*} is not a cyclic group.

Homework Equations



The Attempt at a Solution



A little calculator magic has showed that all elements in the group have order 8, but that doesn't seem like a very educational solution :). If anyone could explain why all elements have the same order, it would be much appreciated.
 
Physics news on Phys.org
It cannot be that all of the elements have order 8 - the square of any element of order 8 has order 4. So, put the calculator away and think instead (or do it by hand).
What is the order of Z/32Z*? Is there an element of that order?
 
The order of (Z/32Z)* (the multiplicative group of units) is phi(32)=16. So if I can show that all elements have order 8 or lower, I've shown that none of them can be generators. I guess my problem is that I don't see how to do this without resorting to a calculator.

I'm not sure what you mean by the square of any element of order 8 has order 4.
 
djxl said:
The order of (Z/32Z)* (the multiplicative group of units) is phi(32)=16. So if I can show that all elements have order 8 or lower, I've shown that none of them can be generators. I guess my problem is that I don't see how to do this without resorting to a calculator.

I'm not sure what you mean by the square of any element of order 8 has order 4.

Think about it, if a has order 8 then a^8=1, what about a^2 though? a^8=(a^2)^4 which says that a^2 has order 4, but besides that an even simpler reason that not all elements have order 8 is that the identity certainly doesn't have order 8.
 
If you don't see why the square of an element of order 8 has order 4, then you need to relearn your definitions of order.

There is a unique cyclic group of order 16. You can count all the elements of all orders. You can then simply show that this group you have to play with fails to have the right properties.
 
Ahh, I get it now. Thanks both of you.
 
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