How to prove that $x^4+x^3+x^2+3x+3$ is irreducible over ring $\mathbb{Z}$ of integers?

Which criterion (test) one can use in order to prove that $x^4+x^3+x^2+3x+3$ is irreducible over ring $\mathbb{Z}$ of integers ?

Neither of Eisenstein's criterion and Cohn's criterion cannot be applied on this polynomial. I know that one can use factor command in Wolfram Alpha and show that polinomial is irreducible but that isn't point of this question.

• Is semi brute force OK? If so, there is an easy argument. It actually doesn't care very much about the coefficient of $x$, as long as integer root is avoided. – André Nicolas Nov 10 '11 at 5:35
• @AndreNicolas,Actually I would like to know if there is some good computational-algebra algorithm – Peđa Terzić Nov 10 '11 at 5:52
• @There are good canned procedures for computing Galois groups. Overkill, probably. – André Nicolas Nov 10 '11 at 6:53

Let your polynomial be $f$. Clearly it has no linear factor, since it has no root in $\mathbb{Z}$. Hence if it factors, it factors as the product of two irreducible quadratics $f_1, f_2$.
Now looking mod $2$ we get a factorization $f=x^4+x^3+x^2+x+1=f_1f_2$ in $\mathbb{F}_2[x]$. Now since $f$ has no root mod $2$, $f_1$ and $f_2$ are also irreducible quadratics in $\mathbb{F}_2[x]$. But the only irreducible quadratic in $\mathbb{F}_2[x]$ is $x^2+x+1$. This would imply $x^4+x^3+x^2+x+1 = (x^2+x+1)^2$ in $\mathbb{F}_2[x]$, which is false.
• +1 Another way of seeing that $x^4+x^3+x^2+x+1$ is irreducible in $F_2[x]$ is to observe that it is a factor of $(x^5-1)=(x-1)(x^4+x^3+x^2+x+1)$. Thus any zero would a root of unity of order five. But $q=16$ is the lowest power of two with the property that $5\mid q-1$, so those roots of unity live in $GF(16)$. Thus their primitive polynomial has to be quartic. Your solution may be simpler. – Jyrki Lahtonen Nov 10 '11 at 6:54
{"ft_lang_label":"__label__en","ft_lang_prob":0.8806488,"math_prob":0.99967885,"size":357,"snap":"2019-43-2019-47","text_gpt3_token_len":91,"char_repetition_ratio":0.12747875,"word_repetition_ratio":0.0,"special_character_ratio":0.23529412,"punctuation_ratio":0.04477612,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9999783,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-14T10:03:24Z\",\"WARC-Record-ID\":\"<urn:uuid:13740855-7775-4150-8eea-bf55d8751b66>\",\"Content-Length\":\"146446\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5b5dc6c5-3e85-47f0-ab5c-60a9eb678312>\",\"WARC-Concurrent-To\":\"<urn:uuid:66e50735-3887-4821-b06c-52e9e529183e>\",\"WARC-IP-Address\":\"151.101.65.69\",\"WARC-Target-URI\":\"https://math.stackexchange.com/questions/80759/how-to-prove-that-x4x3x23x3-is-irreducible-over-ring-mathbbz-of-i\",\"WARC-Payload-Digest\":\"sha1:Z2WGKDJZS5RN7HI2TV32R4JBXVBFWQIY\",\"WARC-Block-Digest\":\"sha1:AL4E6533WY7PWTCK7OYKIWDXBCYSKK6W\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986649841.6_warc_CC-MAIN-20191014074313-20191014101313-00501.warc.gz\"}"}