Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-23T19:32:14.889Z Has data issue: false hasContentIssue false
  • English
  • Français

Buchstab's sifting weights

Published online by Cambridge University Press:  26 February 2010

Marc Laborde
Marc Laborde
Affiliation:
Université Paris 6, Mathématiques Tour 46–0, 4 Place Jussieu.
Get access

Extract

Let be a finite sequence of positive integers. If we want to show that contains primes, or at least almost-primes (i.e. numbers with few prime factors), sieve methods give better results if weights of a certain kind are attached to the elements of .

Type
Research Article
Information
Mathematika , Volume 26 , Issue 2 , December 1979 , pp. 250 - 257
Copyright
Copyright © University College London 1979

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Buchstab, A. A.. Uspehi Mat. Nauk, 22 (135) (1967), 199–226.Google Scholar
2.Richert, H. E.. “Selberg's sieve with weights”, Mathematika, 16 (1969), 1–22CrossRefGoogle Scholar