Results 1 
2 of
2
Integers, without large prime factors, in arithmetic progressions, II
"... : We show that, for any fixed " ? 0, there are asymptotically the same number of integers up to x, that are composed only of primes y, in each arithmetic progression (mod q), provided that y q 1+" and log x=log q ! 1 as y ! 1: this improves on previous estimates. y An Alfred P. Sloan Research Fe ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
: We show that, for any fixed " ? 0, there are asymptotically the same number of integers up to x, that are composed only of primes y, in each arithmetic progression (mod q), provided that y q 1+" and log x=log q ! 1 as y ! 1: this improves on previous estimates. y An Alfred P. Sloan Research Fellow. Supported, in part, by the National Science Foundation Integers, without large prime factors, in arithmetic progressions, II Andrew Granville 1. Introduction. The study of the distribution of integers with only small prime factors arises naturally in many areas of number theory; for example, in the study of large gaps between prime numbers, of values of character sums, of Fermat's Last Theorem, of the multiplicative group of integers modulo m, of Sunit equations, of Waring's problem, and of primality testing and factoring algorithms. For over sixty years this subject has received quite a lot of attention from analytic number theorists and we have recently begun to attain a very pre...
On elementary proofs of the Prime Number Theorem for arithmetic progressions, without characters.
, 1993
"... : We consider what one can prove about the distribution of prime numbers in arithmetic progressions, using only Selberg's formula. In particular, for any given positive integer q, we prove that either the Prime Number Theorem for arithmetic progressions, modulo q, does hold, or that there exists a s ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
: We consider what one can prove about the distribution of prime numbers in arithmetic progressions, using only Selberg's formula. In particular, for any given positive integer q, we prove that either the Prime Number Theorem for arithmetic progressions, modulo q, does hold, or that there exists a subgroup H of the reduced residue system, modulo q, which contains the squares, such that `(x; q; a) ΒΈ 2x=OE(q) for each a 62 H and `(x; q; a) = o(x=OE(q)), otherwise. From here, we deduce that if the second case holds at all, then it holds only for the multiples of some fixed integer q 0 ? 1. Actually, even if the Prime Number Theorem for arithmetic progressions, modulo q, does hold, these methods allow us to deduce the behaviour of a possible `Siegel zero' from Selberg's formula. We also propose a new method for determining explicit upper and lower bounds on `(x; q; a), which uses only elementary number theoretic computations. 1. Introduction. Define `(x) = P px log p, where p only denot...