Irreducible polynomial

Dependencies:

1. Polynomial

$p(x)\in R[x]-R$ is reducible in $R[x]$ iff $\mathrm{\exists }a(x),b(x)\in R[x]-R$ such that $p(x)=a(x)b(x)$. A polynomial is irreducible iff it is not reducible.

Dependency for:

1. Eisenstein's criterion
2. The ideal generated by an irreducible polynomial is maximal

Info:

• Depth: 3
• Number of transitive dependencies: 3

Transitive dependencies:

1. Group
2. Ring
3. Polynomial