I am working on the problem:
If G is a group of order 2n, show that the number of elements of G of order 2 is odd.
which already has solution (in the link below), please explain the solution in that link
I am working on the problem:
If G is a group of order 2n, show that the number of elements of G of order 2 is odd.
which already has solution (in the link below), please explain the solution in that link
OK, the most popular answer defines a relation $x \sim y$ iff $x=y$ or $x=y^{-1}$. You can check that this is indeed an equivalence relation and so we have the set of classes $C_i$, $i \in I$, which form a disjoint partition of $G$. Every class has size $1$ or $2$ (size $1$ iff $C_i = \{x\}$ with $x = x^{-1}$ or equivalently $x^2 = e$. If $x$ is not $e$ and does not have order $2$, it is in a class of size $2$, namely $\{x, x^{-1}\}$. There is at least one class of size $1$, namely $\{e\}$.
If $a$ is the number of classes of size $2$, it has $b:=|I|-a $ classes of size $1$, and $|G| = 2a + b$ and it follows that $b=|G|-2a$ is even, so $b \ge 2$ and so there is at least 1 class besides $\{e\}$ that has size $1$, and this is an element of order $2$.
Please do not send me private e-mail to call my attention to comments, questions, or other matters related to those sites. Thank you. Also, as I no longer participate in those sites, I do not wish to be sent, by private e-mail, questions that you can just as well ask on those sites. I would have thought it was obvious, but apparently I need to say so explicitly." from his profile
– Cloud JR K Aug 12 '18 at 12:38