So assume we have a finite field $F$ and we form the subfield $L$ generated by all elements of the form $x^3$, where $x\in F$. If $L\neq F$ then $L$ must have exactly four elements.
Now my thought was to examine the multiplicative subgroup of $F$, which is cyclic to derive this result, but I'm not sure how to carry through with the argument. There is probably some number theory involved, but I wasn't sure. Can someone help with this.
If $F$ has $q=p^k$ elements, $F^\times$ is cyclic of order $q-1$. The (non-zero) cubes are a subgroup of this, either of index $3$ or the full group. In the latter case we are done, hence assume that the non-zero cubes are a subgroup of index $3$ in $F^\times$. We have to look at addition, but as soon as we find just one non-cube that is the sum of two cubes, $L^\times$ must be strictly larger than the group of non-zero cubes, hence must be all of $F^\times$ and we are done. Hence we may assume that the sum of cubes is always a cube. Then the cubes form a non-trivial additive subgroup of $F$, which must be of order $p^l$ for some $0<l\le k$.
Combining the multiplicative and the additive result, we have $$p^l-1=\frac13(p^k-1),$$ i.e., $$(3-p^{k-l})\cdot p^l=2.$$ As $l>0$, we conclude $p=2$, and then $l=1$ and $k-l=1$.