# Proving that the set of units of a ring is a cyclic group of order 4 The set of units of \mat

Proving that the set of units of a ring is a cyclic group of order 4
The set of units of $\frac{\mathbb{Z}}{10}\mathbb{Z}$ is $\left\{\stackrel{―}{1},\stackrel{―}{3},\stackrel{―}{7},\stackrel{―}{9}\right\}$, how can I show that this group is cyclic?
My guess is that we need to show that the group can be generated by some element in the set, do I need to show that powers of some element can generate all elements in the other congruence classes?
For example ${7}^{2}=49\equiv 9±\mathrm{mod}10$, i.e. using 7 we can generate an element in the congruence class of 9, but can not generate 29 for example from any power of 7, so is it sufficent to say that an element is a generator if it generates at least one element in all other congruence classes?

You can still ask an expert for help

• Questions are typically answered in as fast as 30 minutes

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

belamontern9i
You had just the right idea, then got sidetracked. What you've seen is that ${\stackrel{―}{7}}^{2}=\stackrel{―}{9}$. From this, it does, indeed, follow that ${\stackrel{―}{7}}^{2}=\stackrel{―}{29}$, since we're thinking modulo 10.
From there, ${7}^{3}\equiv 9\cdot 7=63\equiv 3,$
so that ${\stackrel{―}{7}}^{3}=\stackrel{―}{3}$, and similarly, ${\stackrel{―}{7}}^{4}=\stackrel{―}{1}.$
As an alternative, we could show that ${\stackrel{―}{3}}^{2}=\stackrel{―}{9},{\stackrel{―}{3}}^{3}=\stackrel{―}{7}$, and that ${\stackrel{―}{3}}^{4}=\stackrel{―}{1}$, which is arguably even simpler, since ${3}^{2}=9,{3}^{3}=27$, and ${3}^{4}=81$ are math facts you probably know.
###### Not exactly what you’re looking for?
Dexter Conner

Step 1
My guess is that we need to show that the group can be generated by some element in the set, do I need to show that powers of some element can generate all elements in the other congruence classes?
It is enough if you find one element such that its powers cover exactly the group. I would give $\stackrel{―}{3}$ a try.
For example ${7}^{2}=49\equiv 9\text{mod}10$, i.e. using 7 we can generate an element in the congruence class of 9, but can not generate 29 for example from any power of 7, so is it sufficent to say that an element is a generator if it generates at least one element in all other congruence classes?
Step 2
Edited following Cameron Buie's comment: $\stackrel{―}{7}$ actually works, as it generates , in that order.
Let's see what happens with $\stackrel{―}{3}$:
${\stackrel{―}{3}}^{1}=\stackrel{―}{3}$
${\stackrel{―}{3}}^{2}=\stackrel{―}{9}$
${\stackrel{―}{3}}^{3}=\stackrel{―}{27}=\stackrel{―}{7}$
${\stackrel{―}{3}}^{4}=\stackrel{―}{81}=\stackrel{―}{1}$
This is enough. On the one hand, we have covered all the elements in the subgroup. On the other hand, we are now satisfied that ${\stackrel{―}{3}}^{4}$ is the neutral element of the group, so we are positive that for any natural number n, ${\stackrel{―}{3}}^{n}={\stackrel{―}{3}}^{n\text{mod}4}$.