Let be a finite group, and let be the set of all the elements of
The set can be divided up into pairs so that element is paired off with its own inverse. Prove that:
If the order of is even, there is at least one element in such that (neutral element) and (inverse element)
Is it possible to kindly tell me how I can prove this?