Type: Article
Publication Date: 2004-11-16
Citations: 3
DOI: https://doi.org/10.1307/mmj/1100623415
We study the problem of bounding the number of primes p ≤ x in an arithmetic progression for which the largest prime factor of p − h does not exceed y.