I want to determine the number of elements in $\mathbb{Z}_p[x]/ \langle f \rangle$ where $f \in \mathbb{Z}_p[x]$ is an irreducible polynomial with $k$ degree bigger than 2. Is the number of elements always $p^k$? And are the equivalence classes $[f_1],[f_2], \dots, [f_{p^k}]$ always given be the polynomials in $\mathbb{Z}_p$ with degree smaller than $k$?
Number of elements in $\mathbb{Z}_p[x]/ \langle f \rangle$
2
$\begingroup$
field-theory
finite-fields
-
0It seems that you really want to look at $\mathbb Z_p[x]/(f)$, no? For the question proper, think about polynomial division. – 2012-07-03
-
0Use the Euclidean algorithm! It works in $\mathbb{Z}/p\mathbb{Z}[x]$. – 2012-07-03
-
2The cardinal of $\mathbb{Z}_p[x]/(f)$ is $p^k$ even if $f$ is not irreducible. But then, the ring is not a field. – 2012-07-03
-
1Please consider chopping the [factoring] tag: I don't think it applies here. – 2012-07-03
-
1@francis In fact it works over any (finite) coefficient ring when $\rm\:f\:$ is *monic,* since the division algorithm works universally for monic polynomials. – 2012-07-03
1 Answers
2
Yes, you're on the right track of reasoning.
Use the fact that $\mathbb{F}[x]$ has a division algorithm to justify that all possible remainders (=all polynomials of degree strictly less than $k$) form a complete set of distinct residues.
To show that every polynomial is equivalent to a remainder, remember that modding out by $(f)$ is basically saying that $g\equiv h\iff f|(g-h)$. To show that the remainders are distinct, start by writing out what it would mean if two are equivalent, and show it's impossible.
After that, it's easy to count how many remainders! You have $p$ choices for each of the $k$ coefficients of a remainder.
-
0Thanks! That is exactly the argument what I was looking for. – 2012-07-03