Key points are not available for this paper at this time.
procedure Sieve (Nmax) Primes: (p) ; integer Nmax; integer array p ; comment Sieve uses the Sieve of Eratosthenes to find all prime numbers not greater than a stated integer Nmax and stores them in array p. This array should be of dimension 1 by entier (2 X Nmax/t~n (Nmax)) ; begin integer n, i, j ; p1 := 1 ; p2:= 2 ; p3
T. C. Wood (Wed,) studied this question.