Statements (10)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
number theory
|
| gptkbp:namedAfter |
gptkb:Andrzej_Schinzel
|
| gptkbp:publicationYear |
1958
|
| gptkbp:publishedIn |
gptkb:Acta_Arithmetica
|
| gptkbp:relatedTo |
gptkb:Schinzel's_hypothesis_H
|
| gptkbp:sentence |
If a polynomial with integer coefficients takes infinitely many prime values, then it is irreducible and its values are not all divisible by any fixed integer greater than 1.
|
| gptkbp:bfsParent |
gptkb:Andrzej_Schinzel
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Schinzel's theorem
|