{{ 'ml-label-loading-course' | message }}
{{ toc.name }}
{{ toc.signature }}
{{ tocHeader }} {{ 'ml-btn-view-details' | message }}
{{ tocSubheader }}
{{ 'ml-toc-proceed-mlc' | message }}
{{ 'ml-toc-proceed-tbs' | message }}
Lesson
Exercises
Recommended
Tests
An error ocurred, try again later!
Chapter {{ article.chapter.number }}
{{ article.number }}. 

{{ article.displayTitle }}

{{ article.intro.summary }}
{{ 'ml-btn-show-less' | message }} {{ 'ml-btn-show-more' | message }} expand_more
{{ 'ml-heading-abilities-covered' | message }}
{{ ability.description }} {{ ability.displayTitle }}
{{ 'ml-heading-lesson-settings' | message }}
{{ 'ml-lesson-number-slides' | message : article.intro.bblockCount}}
{{ 'ml-lesson-number-exercises' | message : article.intro.exerciseCount}}
{{ 'ml-lesson-time-estimation' | message }}
Image Credits expand_more
No file copyrights entries found
Concept

Irreducible Polynomial

A non-constant polynomial is irreducible over a set of numbers if it cannot be factored into the product of two non-constant polynomials over the same set of numbers. An irreducible polynomial is also called a prime polynomial.

All polynomials of the form where are prime polynomials.

When a polynomial is not prime, it is called a reducible polynomial. Keep in mind that a given polynomial can be prime over one set of numbers but reducible over another.
Four polynomials and a table classifying them as prime or not over a set
Over the set of the complex numbers, only the linear polynomials are prime. This can be proven by using the Fundamental Theorem of Algebra.
{{ grade.displayTitle }}