Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How to prove that for every finite field its cardinality is $p^n$ where $p$ is prime and $n\in\mathbb{N}$?

Thanks in advance!

share|cite|improve this question
Have you seen these proofs at Wikipedia? – joriki Nov 30 '12 at 7:13
up vote 6 down vote accepted

The prime field of $F$, which is the smallest subfield of $F$ or the field obtained by taking the elements $0, 1, 1+1, 1+1+1, \ldots$ must be some $\mathbb Z/p\mathbb Z$. To make this a field, $p$ must be prime. Then $F$ is a vector space over $\mathbb Z/p\mathbb Z$, which makes its cardinality $|\mathbb Z/p\mathbb Z|^{\operatorname{dim}F}$.

share|cite|improve this answer

The characteristic of a finite field $F$ is some prime number $p$. Then for any $a\in F$ holds that $p\cdot a=0$ (here $p\cdot a$ means $a$ plus itself $p$ times). So, in $F$, considered simply as an additive group, every element has order $p$. Thus it is a $p$-group and since any $p$-group (by Cauchy's Theorem) has order a power of $p$ the proof is complete.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.