For every integer n greater than 2, Prove that the group U(n^2-1) is not cyclic.
Maybe proof by contrapositive.
I'm not sure what you mean?
Okay, first what is your definition of cyclic group?
generated by an element and the gcd between the generator and an element in the cyclic group has to be 1
So all elements are coprime so some generator in the set?
yes, at least I believe that's right
Hmmm, well we know all the numbers in the group can be factored as \((n-1)(n+1)\)
ok
so how would I answer this?
\(U(n)\) if i remember correctly is the group of units of integers modulo \(n\) is that correct?
in that case there are 4 elements \(g\) with \(g^2=1\) i.e. 4 elements that are there own inverses
which i guess i should add is not possible in a cyclic group. since \(n^2-1=(n+1)(n-1)\) we have as units \(1,-1,n,-n\)
So my answer is that since a cyclic group can't have the elements as their own inverses, then this group cannot be cyclic?
Join our real-time social learning platform and learn together with your friends!