Counting primes in residue classes

نویسندگان

  • Marc Deléglise
  • Pierre Dusart
  • Xavier-François Roblot
چکیده

We explain how the Meissel-Lehmer-Lagarias-Miller-Odlyzko method for computing π(x) can be used for computing efficiently π(x, k, l), the number of primes congruent to l modulo k up to x. As an application, we computed the number of prime numbers of the form 4n ± 1 less than x for several values of x up to 1020 and found a new region where π(x, 4, 3) is less than π(x, 4, 1) near x = 1018.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unexpected Biases in the Distribution of Consecutive Primes

While the sequence of primes is very well distributed in the reduced residue classes (mod q), the distribution of pairs of consecutive primes among the permissible φ(q) pairs of reduced residue classes (mod q) is surprisingly erratic. This paper proposes a conjectural explanation for this phenomenon, based on the Hardy-Littlewood conjectures. The conjectures are then compared to numerical data,...

متن کامل

ON THE RESIDUE CLASSES OF π(n) MODULO t

The prime number theorem is one of the most fundamental theorems of analytic number theory, stating that the prime counting function, π(x), is asymptotic to x/ log x. However, it says little about the parity of π(n) as an arithmetic function. Using Selberg’s sieve, we prove a positive lower bound for the proportion of positive integers n such that π(n) is r mod t for any fixed integers r and t....

متن کامل

# A 79 INTEGERS 13 ( 2013 ) ON THE RESIDUE CLASSES OF ⇡ ( n ) MODULO t Ping

The prime number theorem is one of the most fundamental theorems of analytic number theory, stating that the prime counting function, ⇡(x), is asymptotic to x/ log x. However, it says little about the parity of ⇡(n) as an arithmetic function. Using Selberg’s sieve, we give, for any fixed integers r and t, a positive lower bound on the proportion of positive integers n such that ⇡(n) is congruen...

متن کامل

Products in Residue Classes

Abstract. We consider a problem of P. Erdős, A. M. Odlyzko and A. Sárkőzy about the representation of residue classes modulom by products of two not too large primes. While it seems that even the Extended Riemann Hypothesis is not powerful enough to achieve the expected results, here we obtain some unconditional results “on average” over moduli m and residue classes modulo m and somewhat strong...

متن کامل

Unexpected biases in the distribution of consecutive primes.

Although the sequence of primes is very well distributed in the reduced residue classes [Formula: see text], the distribution of pairs of consecutive primes among the permissible ϕ(q)(2) pairs of reduced residue classes [Formula: see text] is surprisingly erratic. This paper proposes a conjectural explanation for this phenomenon, based on the Hardy-Littlewood conjectures. The conjectures are th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Comput.

دوره 73  شماره 

صفحات  -

تاریخ انتشار 2004