Computational sieving applied to some classical number-theoretic problems

Abstract

Abstract. Many problems in computational number theory require the application of some sieve. Efficient implementation of these sieves on modern computers has extended our knowledge of these problems considerably. This is illustrated by three classical problems: the Goldbach conjecture, factoring large numbers, and computing the summatory function of the Mobius function.