Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-11T04:22:33.042Z Has data issue: false hasContentIssue false
  • English
  • Français

The asymptotics of random sieves

Part of: Multiplicative number theory

Published online by Cambridge University Press:  26 February 2010

G. R. Grimmett  and
R. R. Hall
G. R. Grimmett
Affiliation:
School of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW
R. R. Hall
Affiliation:
Department of Mathematics, University of York, Heslington, York. YO1 5DD
Get access

Extract

Let J = (s1, s2, … ) be a collection of relatively prime integers, and suppose that π(n) = |J∩{1,2,…, n}| is a regularly varying function with index a satisfying 0 < α < l. We investigate the “stationary random sieve” generated by J, proving that the number of integers less than k which escape the action of the sieve has a probability mass function with approximate order k-α/2 in the limit as k → ∞. This result may be used to deduce certain asymptotic properties of the set of integers which are divisible by no s є J, in that it gives new information about the usual deterministic (that is, non-random) sieve. This work extends previous results valid when si=pi2, the square of the ith prime.

MSC classification

Secondary: 11N25: Distribution of integers with specified multiplicative constraints
Type
Research Article
Information
Mathematika , Volume 38 , Issue 2 , December 1991 , pp. 285 - 302
Copyright
Copyright © University College London 1991

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

Barbour, A. D. and Hoist, L. (1989). Some applications of the Stein-Chen method for proving Poisson convergence. Advances in Applied Probability, 21, 74–90.CrossRefGoogle Scholar
Barbour, A. D., Hoist, L. and Janson, S. (1991). Poisson Approximation (Oxford University Press).Google Scholar
Bingham, N. H., Goldie, C. M. and Teugels, J. (1987). Regular Variation (Cambridge University Press, Cambridge).CrossRefGoogle Scholar
Chow, Y. S. and Teicher, H. (1978). Probability Theory (Springer-Verlag, New York).CrossRefGoogle Scholar
Feller, W. (1971). An Introduction to Probability Theory and its Applications, volume 2 (John Wiley and Sons, New York).Google Scholar
Grimmett, G. R. (1991). The statistics of sieves and the square-free numbers. J. London Math. Soc, 43, 1–11.CrossRefGoogle Scholar
Grimmett, G. R. and Stirzaker, D. R. (1982). Probability and Random Processes (Clarendon Press, Oxford).Google Scholar
Hall, R. R. (1982). Squarefree numbers on short intervals. Mathematika, 29, 7–17.CrossRefGoogle Scholar
Hall, R. R. (1989). The distribution of squarefree numbers. J. für reine u. ange. Math., 394, 107–117.Google Scholar
Kolchin, V. F., Sevastyanov, B. A. and Chistyakov, V. P. (1978). Random Allocations (J. Wiley and Sons, New York).Google Scholar