The least prime in an arithmetic progression with prime difference. (Q4152620)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3582252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The least prime in an arithmetic progression with prime difference. |
scientific article; zbMATH DE number 3582252 |
Statements
The least prime in an arithmetic progression with prime difference. (English)
0 references
1978
0 references
least prime in arithmetic progression
0 references
prime difference
0 references
Brun sieve method
0 references
0.9053170680999756
0 references
0.8461899757385254
0 references
0.8436292409896851
0 references
Write \(P(k,l)\) for the least prime in the arithmetic progression \(l+k, l+2k,\ldots\). Then, for all positive integers \(l\) and all \(\varepsilon > 0\), we have \[ P(p,l) > \frac{p \log p}{(\log \log p)^{1+ \varepsilon}} \] for all primes \(p\) except for a set of primes the sum of whose reciprocals converges. A simple consequence is that, for every positive integer \(l\), we have \(\sum P(p,l)^{-1} < \infty\), where the sum is over all primes \(p\) not dividing \(l\).
0 references