Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Assuming that G is a finite cyclic group, let "a" be the product of all the elements in the group.

i. If G has odd order, then a=e. Is this because there are an even number of non-trivial elements must have their inverses within the non-trivial factors within the product?

ii. If G has even order then a is not equal to e. Here there an odd number of non-trivial elements. There must also be an odd number of elements who are their own inverses, and therefore a cannot equal e?

Thanks for any help! I'm just reading a textbook and trying practice problems!

share|cite|improve this question
Your statements are true. Try to improve the writing. – Sigur Feb 6 '13 at 23:59
This is essentially Wilson's theorem for finite abelian groups:…. – lhf Feb 7 '13 at 0:18
Thanks everyone. Makes complete sense now. Much appreciated! – Luke8ball Feb 7 '13 at 0:41

Since we know it is a finite cyclic group,

Hint: $ 1 + 2 + \ldots + n = \frac {n (n+1)}{2}$

This is a multiple of $n$ if $n$ is odd, and not a multiple of $n$ if $n$ is even.

Your statements are true, and don't just apply to a finite cyclic group. I would prefer your solution over mine, but I think the above is what the textbook had in mind.

share|cite|improve this answer

Let $\,G=\langle x\rangle =\{1\,,\,x\,,\,x^2\,,\,\ldots\,,\,x^{n-1}\}\,$:

$$x\cdot x^2\cdot\ldots\cdot x^{n-1}=x^{\frac{n(n-1)}{2}}=\begin{cases}x^{(n-1)k}\neq 1&\,,\,\,\text{ if}\,\;\;\;n=2k\,\,\,\text{ is even}\\{}\\x^{kn}=1&\,,\,\text{ if}\,\;\;n-1=2k\,\,\,\text{is even}\end{cases}$$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.