Legendre sieve

Legendre sieve

In mathematics, the Legendre sieve is the simplest method in modern sieve theory. It applies the concept of the Sieve of Eratosthenes to find upper or lower bounds on the number of primes within a given set of integers. Because it is a simple extension of Eratosthenes' idea, it is sometimes called the Legendre-Eratosthenes sieve.

Legendre's identity

The central idea of the method is expressed by the following identity, sometimes called the Legendre identity:

:S(A,P)= sum_{ain A}sum_{d|a;d|P} mu(d) =sum_{d|P}mu(d)|A_d|

where "A" is a set of integers, "P" is a product of distinct primes, mu is the Möbius function, and A_d is the set of integers in "A" divisible by "d", and "S(A, P)" is defined to be:

:S(A, P) = |{n: n in A, (n, P) = 1}|

i.e. "S(A,P)" is the count of numbers in "A" with no factors common with "P".

Note that in the most typical case, "A" is all integers less than or equal to some real number "X", "P" is the product of all primes less than or equal to some integer "z < X", and then the Legendre identity becomes:

(where lfloor X floor denotes the floor function). In this example the fact that the Legendre identity is derived from the Sieve of Eratosthenes is clear: the first term is the number of integers below "X", the second term removes the multiples of all primes, the third term adds back the multiples of two primes (which were miscounted by being "crossed out twice"), and so on until all 2^{pi(z)} (where pi(z) denotes the number of primes below "z") combinations of primes have been covered.

Once S(A,P) has been calculated for this special case, it can be used to bound pi(X) using the expression

:S(A,P) geq pi(X) - pi(z) + 1

which follows immediately from the definition of S(A,P).

Problems

Unfortunately, the Legendre sieve has a problem with fractional parts of terms accumulating into a large error, which means the sieve only gives very weak bounds in most cases. For this reason it is almost never used in practice, having been superseded by other techniques such as the Brun sieve and Selberg sieve. However, since these more powerful sieves are extensions of the basic ideas of the Legendre sieve, it is useful to first understand how this sieve works.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Sieve theory — is a set of general techniques in number theory, designed to count, or more realistically to estimate the size of, sifted sets of integers. The primordial example of a sifted set is the set of prime numbers up to some prescribed limit X .… …   Wikipedia

  • Legendre relation — The term Legendre relation may refer to: * The Legendre sieve, for determining whether an integer is prime. * The Legendre duplication formula for the gamma function …   Wikipedia

  • List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… …   Wikipedia

  • Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… …   Wikipedia

  • Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …   Wikipedia

  • Cipolla's algorithm — In computational number theory, Cipolla s algorithm is a technique for solving a congruence of the form x2 = n, where , so n is the square of x, and where p is an odd prime. Here denotes the finite field with p elements; . Th …   Wikipedia

  • Theorie des cribles — Théorie des cribles En mathématiques, la théorie des cribles est une partie de la théorie des nombres ayant pour but d estimer, à défaut de dénombrer, les cardinaux de sous ensembles (éventuellement infini) de N en approchant la fonction… …   Wikipédia en Français

  • Théorie des cribles — En mathématiques, la théorie des cribles est une partie de la théorie des nombres ayant pour but d estimer, à défaut de dénombrer, les cardinaux de sous ensembles (éventuellement infini) de N en approchant la fonction indicatrice du sous ensemble …   Wikipédia en Français

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”