Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

I'm trying to understand distinct-degree factorization from Wikipedia.

I'm trying the algorithm on paper with $q=9$ and $f(x) = (x+4)(x+5) = x^2+2 \in F_{q}$.

We start with $i=1$. I calculate $g = gcd(f, x^q-x) = gcd(f, 6x)$ but at this point I am not sure what to do since $6x$ is not a member of $F_{q}[x]$. I can't work out the gcd. Basically I'm finding that the algorithm breaks down.

Is this a limitation of the algorithm or am I doing something wrong?

share|cite|improve this question
Note that $6=0$ in the field of $9$ elements. – Gerry Myerson Feb 11 '13 at 23:23

In the field of $9$ elements, $x^2+2=x^2-1=(x+1)(x-1)$. The polynomial $x^9-x$ is zero at both $1$ and $-1$, so it is divisible by $x+1$ and by $x-1$. It follows that $\gcd(f,x^9-x)=f$. I don't know where you got $6x$.

I'm sure you're aware that the field of $9$ elements is not the ring of integers modulo $9$.

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.