Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
arithmetic progressions
|
| gptkbp:countryOfOrigin |
gptkb:Soviet_Union
|
| gptkbp:field |
number theory
|
| gptkbp:hasConstant |
gptkb:Linnik_constant
|
| https://www.w3.org/2000/01/rdf-schema#label |
Linnik's theorem
|
| gptkbp:influenced |
analytic number theory
|
| gptkbp:namedAfter |
gptkb:Yuri_Linnik
|
| gptkbp:relatedTo |
least prime in arithmetic progression
|
| gptkbp:sentence |
There exists a constant L such that for every sufficiently large odd integer n, the least prime p congruent to a given residue class modulo n is less than n^L.
|
| gptkbp:yearProved |
1944
|
| gptkbp:bfsParent |
gptkb:Dirichlet's_theorem_on_arithmetic_progressions
|
| gptkbp:bfsLayer |
5
|