Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
polynomials
prime numbers |
| gptkbp:field |
gptkb:algebra
number theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Gauss's lemma
|
| gptkbp:namedAfter |
gptkb:Carl_Friedrich_Gauss
|
| gptkbp:publishedIn |
gptkb:Disquisitiones_Arithmeticae
|
| gptkbp:relatedTo |
irreducibility
unique factorization domain primitive polynomial |
| gptkbp:sentence |
If a polynomial with integer coefficients is reducible over the rationals, then it is reducible over the integers.
If p is a prime and p divides the product ab, and p does not divide a, then p divides b. |
| gptkbp:bfsParent |
gptkb:Louis_Gauss
gptkb:Louis_Gauß |
| gptkbp:bfsLayer |
6
|