Answers are grounded in this paper and cite their sources.
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 ; p[1] := 1 ; p[2]:= 2 ; p[3]
No takes yet. Share an insight, caveat, or question.
T. C. Wood (1961) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: