6
$\begingroup$

A field $F$ has at most a finite number of elements of order $\leq n$ for any $n$ in integers.

How can I prove this? I thought it's related to the fact that a polynomial of degree $n$ would have at most $n$ roots over $F$. But I am not sure. Would appreciate hints.

  • 1
    @Dylan: simple + brutal= perfect!2012-02-18

2 Answers 2

4

Hint: by pigeonholing, if there are infinitely many elements of order $\le n$ then for some $k\le n$ there are infinitely many elements of order $k,\:$ hence $x^k - 1$ has infinitely many roots $\:\Rightarrow\Leftarrow$

3

Your idea works. There are various ways to carry it out. For example, let $N$ be the least common multiple of the numbers $1, 2, \dots, n$. Then every element of order $\le n$ is a zero of the polynomial $x^N-1=0$. Or else, more wastefully, you can use the polynomial $\prod_{k=1}^n (x^k-1)$.