| 1 | initial version |
If $p$ is a prime, then GF(p^n,'x') is obtained by computing $F_p / (f(x))$ where $f$ is a monic, irreducible polynomial of degree $n$ in $F_p[x]$. For $n=1$, you just get $F_p[x] / (x) \cong F_p$.
So, for any prime $p$, GF(p,'x') is [0,1,2,...,p-1].
| 2 | No.2 Revision |
If $p$ is a prime, then GF(p^n,'x') is obtained by computing $F_p $F_p[x] / (f(x))$ where $f$ is a monic, irreducible polynomial of degree $n$ in $F_p[x]$. For $n=1$, you just get $F_p[x] / (x) \cong F_p$.
So, for any prime $p$, GF(p,'x') is [0,1,2,...,p-1].
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.