# Thread:

1. ## Irreducible polynomial mod p^2

Consider the polynomial $x^{2} + p$ modulo $p^{2}$.

I would like to show that this polynomial is irreducible. Unfortunately I don't see how I can apply any of the usual tricks (Eisenstein, simple enumeration in the case of fields of small characteristic) might work.

2. Suppose $x^2+p\pmod{p^2}$ is reducible. Then, $x^2+p\equiv 0\pmod{p^2}$ has a solution. By reducing the modulus, we have $x^2\equiv 0\pmod{p}$, so $x$ is divisible by $p$. Write $x=py$. Putting this back into the original equation gives $(py)^2+p\equiv p^2y^2+p\equiv p \equiv 0\pmod{p^2}$, which is certainly not true.

Therefore, $x^2+p\pmod{p^2}$ is irreducible.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 10, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9285991787910461, "perplexity_flag": "head"}