Skip to main content
SpringerLink
Log in

Explaining the wheel sieve

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In a previous paper, an algorithm was presented for the classical problem of finding all prime numbers up to a given limit. The algorithm was derived therein by transforming a prior algorithm in accordance with some essentially ad hoc observations on the problem.

The present paper complements the former by developing a simple mathematical framework, which leads to a smoother and more insightful derivation of the new algorithm, and which may be of independent interest to the number theorist.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brent, R.P.: The first occurrence of large gaps between successive primes. Maths. of Comp. 27, 959–963 (1973)

    Google Scholar 

  2. Erdös, P., Penney, D.E., Pomerance, C: On a class of relatively prime sequences. J. Number Theory 10, 451–474 (1978)

    Google Scholar 

  3. Kanold, H.J.: Über Primzahlen in arithmetischen Folgen. Math. Ann. 156, 393–395 (1964); II, Math. Ann. 157, 358–362 (1965)

    Google Scholar 

  4. Lakatos, I.: Proofs and refutations. Cambridge: Cambridge University Press 1976

    Google Scholar 

  5. Le Veque, W.J.: Elementary theory of numbers. Reading, Ma: Addison-Wesley 1965

    Google Scholar 

  6. Misra, J.: An exercise in program explanation. ACM Trans. Program. Lang. Syst. 3, 104–109 (1981)

    Google Scholar 

  7. Pomerance, C.: A note on the least prime in an arithmetic progression. J. Number Theory 12, 218–223 (1980)

    Google Scholar 

  8. Pritchard, P.: A sublinear additive sieve for finding prime numbers. Comm. ACM 24, 18–23 (1981)

    Google Scholar 

  9. Pritchard, P.: Another look at the “longest ascending subsequence” problem. Acta Informat. 16, 87–91 (1981)

    Google Scholar 

  10. Sierpiński, W.: Elementary theory of numbers. Warsaw: Państwowe Wydawnictwo Naukowe 1964

    Google Scholar 

  11. Wunderlick, M.D., Selfridge, J.L.: A design for a number theory package with an optimized trial division routine. Commun. ACM 17, 272–277 (1974)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, 14853, Ithaca, New York, USA

    Paul Pritchard

Authors
  1. Paul Pritchard
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

A preliminary version of this paper was presented at the fourth Australian Computer Science Conference, Brisbane, 1981

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pritchard, P. Explaining the wheel sieve. Acta Informatica 17, 477–485 (1982). https://doi.org/10.1007/BF00264164

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264164

Keywords

Search

Navigation