Here's my homework problem:
Let $K = \mathbb{Z}_2[x] / \langle x^4 + x^3 + 1\rangle$. Show the polynomial $p(x) = x^3 + x + 1$ is irreducible in $K[x]$.
Since the polynomial is third-degree, I suppose it would be sufficient to show that it has no zeroes. But that would require a brute-force check of every element of $K$, of which there are many. Surely this isn't the only way?
So, my question is: what is the most practical proof technique for showing that this polynomial is irreducible?
Please don't solve the problem for me - I'm just looking for a nudge. Thanks!

<and>denote "less than" and "greater than", and using them for purposes other than this will produce strange spacing. The symbols you should be using, angle brackets, are obtained with the commands\langleand\rangle. – Zev Chonoles Mar 06 '13 at 03:55