On the small sieve. I. Sifting by primes
نویسندگان
چکیده
منابع مشابه
On the Small Sieve . I . Sifting by Primes
The main object of the paper is to prove that if P is a set of primes with sum of reciprocals _cx, where c is a positive constant depending only on K. A lower estimate is given for c and a similar result is achieved in the case when the condition of primality is substituted by the weaker condition that any m elem...
متن کاملAsymptotic sieve for primes
For a long time it was believed that sieve methods might be incapable of achieving the goal for which they had been created, the detection of prime numbers. Indeed, it was shown [S], [B] to be inevitable that, in the sieve’s original framework, no such result was possible although one could come tantalizingly close. This general limitation is recognized as the “parity problem” of sieve theory. ...
متن کاملSmall Gaps between Primes I
Finding mathematical proofs for easily observed properties of the distribution of prime numbers is a difficult and often humbling task, at least for the authors of this paper. The twin prime conjecture is a famous example of this, but we are concerned here with the much more modest problem of proving that there are arbitrarily large primes that are “unusually close ” together. Statistically thi...
متن کاملThe “sieve” Algorithm—sifting Data in the Real World
Experimental data are rarely, if ever, distributed as a normal (Gaussian) distribution, in real world applications. A large set of data—such as the cross sections for particle scattering as a function of energy contained in the archives of the Particle Data Group1—is a compendium of all published data, and hence, unscreened. For many reasons, these data sets have many outliers—points well beyon...
متن کاملThe Large Sieve for 2 modulo Primes
Let λ be a fixed integer, λ ≥ 2. Let s n be any strictly increasing sequence of positive integers satisfying s n ≤ n 15/14+o(1). In this paper we give a version of the large sieve inequality for the sequence λ sn. In particular, we prove that for π(X)(1 + o(1)) primes p, p ≤ X, the numbers λ sn , n ≤ X(log X) 2+ε are uniformly distributed modulo p.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1980
ISSN: 0022-314X
DOI: 10.1016/0022-314x(80)90032-3