Abstract
Suppose that is a set of primes, such that for every, every prime factor of p-1 is also in. We apply a new sieve method to show that either contains all of the primes or the counting function of is O(x1-c) for some c>0, where c depends only on the smallest prime not in. Our proof makes use of results connected with Artin's primitive root conjecture.
Original language | English (US) |
---|---|
Pages (from-to) | 2955-2971 |
Number of pages | 17 |
Journal | International Mathematics Research Notices |
Volume | 2014 |
Issue number | 11 |
DOIs | |
State | Published - 2014 |
ASJC Scopus subject areas
- General Mathematics