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

I am aware that it is straightforward to prove that a group of even order has an odd number of elements of order 2 just by noting that elements of order greater than 2 come in pairs necessarily (i.e. $|a|>2 \implies a\neq a^{-1}$).

However, I am curious to know whether there is a way to prove this quickly just by using properties of cosets, maybe Lagrange's theorem?

Thanks for any ideas!

share|cite|improve this question
up vote 1 down vote accepted

Lagrange's theorem is necessary here because a group containing any elements of order $2$ ("involutions") must have even order. I don't think there is alternative proof using cosets, however, because the set of involutions doesn't necessarily form a subgroup, even when including the identity (nor does the set of elements with order $>2$). The easiest example of this is $D_4$, which has order $8$, yet is generated by (even just two of) its five involutions. The $|a|>2\Rightarrow a\not= a^{-1}$ element is already quite simple, though. I would just stick with that.

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.