--- title: "Polynomial Rings, Irreducibility and Unique Factorisation" description: "Polynomials over a field divide with remainder, and that single fact forces unique factorisation into irreducibles. Deciding whether a given polynomial is irreducible over the rationals needs tests ra" canonical: https://lightmysky.com/learn/mathematics/polynomial-rings-irreducibility-and-unique-factorisation-mt_m2G9PIHj6y source: https://lightmysky.com/learn/mathematics/polynomial-rings-irreducibility-and-unique-factorisation-mt_m2G9PIHj6y.md retrieved: 2026-09-12 --- > **Agent view.** This is the Markdown twin of the page, for tools and assistants. > When to use this site, and the call that answers each job: https://lightmysky.com/agent-instructions.md > API description (OpenAPI 3.1): https://lightmysky.com/openapi.json · Authentication: https://lightmysky.com/auth.md > Pricing: https://lightmysky.com/pricing.md · Catalog: https://lightmysky.com/llms.txt · Full catalog: https://lightmysky.com/llms-full.txt > Every machine-readable file on this domain: https://lightmysky.com/.well-known/ai-catalog.json > Ask for Markdown with `Accept: text/markdown`, a `.md` address, or `?mode=agent`. # Polynomial Rings, Irreducibility and Unique Factorisation Polynomials over a field divide with remainder, and that single fact forces unique factorisation into irreducibles. Deciding whether a given polynomial is irreducible over the rationals needs tests rather than inspection. Subject: Mathematics · Area: Abstract Algebra · Ages 22 to 24 Page: https://lightmysky.com/learn/mathematics/polynomial-rings-irreducibility-and-unique-factorisation-mt_m2G9PIHj6y ## Ready when they can - Divide polynomials with remainder and read off what it says about roots - Apply Eisenstein's criterion and reduction modulo a prime - Trace the chain from division with remainder to principal ideals to unique factorisation ## Lesson: Dividing polynomials and factoring uniquely You divide polynomials over a field like numbers, and the remainder tells you if you found a factor. The Remainder Theorem says dividing f by x minus a leaves f(a), so one evaluation replaces long division. Then x minus a is a factor exactly when f(a) is zero. So x squared plus 7x plus 10 over x plus 2 gives x plus 5 remainder 0, while x squared plus 5x plus 3 over x plus 1 gives x plus 4 remainder minus 1. **Example.** You use the same idea on harder cases. For f equal to x cubed minus 2x squared plus 3x minus 6, f(2) is 0, so x minus 2 is a factor and f equals (x minus 2) times (x squared plus 3). You also factor four-term cubics by grouping: x cubed plus 4x squared plus 5x plus 20 is (x squared plus 5) times (x plus 4), and x cubed minus 3x squared plus 7x minus 21 is (x squared plus 7) times (x minus 3). Over the reals, x squared plus 1 has no root, so it is irreducible there. You then follow one chain that explains unique factorisation. Division with remainder gives a gcd process for polynomials, that process shows an irreducible dividing a product must divide one factor, and from there every polynomial breaks into irreducibles in only one way, up to order and constant multiples. That is why deciding irreducibility with tests like Eisenstein or reduction mod p matters: the tests find the prime pieces. **Recap.** You divide to test factors with remainders, and that division powers the unique factorisation of polynomials. ## Practice 16 questions on this page, each with its working shown. ## Needs first - [Ideals and Quotient Rings](https://lightmysky.com/learn/mathematics/ideals-and-quotient-rings-mt_uQBA9E1JIP) - [Roots of Polynomials and Roots of Unity](https://lightmysky.com/learn/mathematics/roots-of-polynomials-and-roots-of-unity-mt_XAISygqdQr) ## Opens up - [Modules: Linear Algebra Over a Ring](https://lightmysky.com/learn/mathematics/modules-linear-algebra-over-a-ring-mt_0GMVp-s8wD) - [Field Extensions and Their Degrees](https://lightmysky.com/learn/mathematics/field-extensions-and-their-degrees-mt_CjOMNt5_i0)