Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
prime numbers
polynomials with integer coefficients |
| gptkbp:field |
gptkb:algebra
|
| https://www.w3.org/2000/01/rdf-schema#label |
Eisenstein criterion
|
| gptkbp:namedAfter |
gptkb:Ferdinand_Eisenstein
|
| gptkbp:publishedIn |
1850
|
| gptkbp:stated_as |
if there exists a prime p such that p divides all coefficients except the leading, p does not divide the leading coefficient, and p^2 does not divide the constant term, then the polynomial is irreducible over the rationals
|
| gptkbp:used_in |
abstract algebra
number theory |
| gptkbp:usedFor |
irreducibility of polynomials
|
| gptkbp:bfsParent |
gptkb:Ferdinand_Eisenstein
gptkb:Gotthold_Eisenstein |
| gptkbp:bfsLayer |
5
|