1

So I have a problem (from Cryptography course, actually) that I'm really struggling with for almost a week.

Let $G$ be a finite group, and let $e$ denote its neutral element. I need to prove the following claims:

  1. There exists $E := min\{k \in \mathbb{N}: g^k = e$ for all $g \in G\}$ and $E \le |G|$.
  2. If $G$ is abelian, then there exists some element in $G$ of order $E$.
  3. If $K$ is a field and $G \le K^*$, then $G$ is cyclic.

I am completely new to this kind of Algebra so any hint would be highly appreciated. Also, for part 2, I have been already given a hint even though I've no clue how to use it in this context

Hint: for $a,b \in G, \langle a,b\rangle$ contains an element of order $lcm(ord(a), ord(b))$

  • 1
  • This follows from Lagrange's theorem. 2. Consider an element of maximum order. 3. See https://math.stackexchange.com/questions/59903/finite-subgroups-of-the-multiplicative-group-of-a-field-are-cyclic and https://mathoverflow.net/questions/54735/collecting-proofs-that-finite-multiplicative-subgroups-of-fields-are-cyclic.
  • – lhf May 25 '17 at 11:57