## 3 Answers

I will proove it using contradiction. Assuming no element has order $2.$ i.e., $a^2 \neq e$ for any non-identity element $a,$ means

$a \neq a^{-1}$ for any (non-identity element) $a.$

Rewriting the statement: the inverse of any element is not that element itself, it is something else.

But I want to somehow show that at least one element has inverse as its own. I am trying a method lets see if it works :).

I will select each element from the set and will check inverse of each element, and in this process, as soon as I encounter any element having $a^2 \neq e$ then I am done.

**My Goal: **to show $G$ has at least $1$ element as its own inverse.

Let $|G| = 2n$. Then we take out the identity and have $2n-1$ elements to choose from.

**Step 1:** Select an element, if it is its own inverse then I am done.

**Step 2** **(otherwise)**: If inverse of $a$ is not $a$ and is $b,$ throw $a$ and $b$ out. $(\because$ if $a$ inverse is $b$ then $b$ inverse is $a$, and inverse of an element is unique$)$

(Notice we always throw one pair)

In worst case I will end up throwing all but one element, because total number of elements is odd $(2n-1)$ and we always throw a pair of two (even).

Now question is, what is the inverse of that element?

**It has to be its own inverse**, it can not map to inverse of any other element because inverse is unique. And moreover it can not be inverse of identity element because inverse of identity is identity itself.

Finally, I can say there exist one non-identity element $a$ of order $2.$

Yes, it worked !

Hence Proved !

### 9 Comments

So it has even number of elements.

Now the order of each element of a group have to be divisor of the order of the group.

So, let us assume we have an element $a$ with order 2k and this means $a^{2k}=e$

Now I can rewrite the above as $(a^k)^2=e$

Now since a group has closure property, $a^k$ would surely belong to one of the element of the group, say it is x.

Now $x^2=e$ and we have proved what we wanted.

Now what i can say for group of even order has even no. of elemnt in it at-east one time identity elemnet come to diagonal place exept for identity element itself, at that time a^{2} = e is happen .

**Point -1:** Identity element has its own inverse but we cannot take it.**[ Given in question a≠e]**

**Point-2 :** since even numbers total but we left with odd numbers (2n-1). an we know if a is inverse of b then b is also inverse of a.

So 2n-2 elements are got pairing with thier inverse so 1 left element is its own inverse.

In image 4 is that element.

Think of this like the theorem in Graph Theory that the number of vertices with odd degree must be even.

To prove: If G is a group of even order, then there exists an element a, such that order of a is 2. And, a can't be the identity.

We know that if an element is its own inverse, its order is 2.

ie, if $a=a^{-1}$ then $a^2=e$

Say the group has 2n elements, (hence always even order).

The inverse of the first element is the last element.

The inverse of the second element is the second last element.

The inverse of the third element is the third last element.

So on...

We know, we can make pairs out of even numbers easily. For 2n numbers, we can have n pairs.

BUT

Somewhere in this sequence, we'll encounter the identity element. The inverse of the identity element is the identity element itself!

That means all the pairs aside, we have a standalone element a, and an identity element.

Since every element must have an inverse in a group, and no two elements have the same inverse => a must be it's own inverse.

So, order of a is 2.

Proved.