Paul Pritchard
- 1 Aho, A., Hopcroft, J., and Ullman, J. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974. Google Scholar
Digital Library
- 2 Brent, R.P. The first occurrence of large gaps between successive primes. Math. Comp. 27, 124 (Oct. 1973), 959-963.Google ScholarCross Ref
- 3 Dijkstra, E.W. Guarded commands, nondeterminacy and formal derivation of programs. Comm. A CM 18, 8 (Aug. 1975), 453--457. Google ScholarDigital Library
- 4 Gale, R., and Pratt, V. CGOL--an algebraic notation for MACLISP users. M.I.T. Artif. Intell. Lab., Cambridge, Mass., Jan. 1977, (working paper.)Google Scholar
- 5 Giles, D., and Misra, J. A linear sieve algorithm for fmding prime numbers. Comm. ACM 21, 12 (Dec. 1978), 999-1003. Google ScholarDigital Library
- 6 Hardy, G.H., and Wright, E.M. An Introduction to the Theory of Numbers. 5th Ed., Oxford Univ. Press, Oxford, England 1979.Google Scholar
- 7 Heath-Brown, D.R., and Iwaniec, H. On the difference between consecutive primes. Bull. Am. Math. Soc. 1 (new series), 5 (Sept. 1979), 758-760.Google Scholar
- 8 Mairson, H.G. Some new upper bounds on the generation of prime numbers, Comm. ACM 20, 9 (Sept. t977), 664-669. Google ScholarDigital Library
- 9 Misra, J. An exercise in program explanation. Tech. Rept., Dept Comptr. Sci., Univ. of Texas, Austin, Texas, Aug. 1979. Google ScholarDigital Library
- 10 Pritchard, P. Variations on a scheme of Eratosthenes. Rept. No. 8, Dept. Comptr. Sci., Univ. of Queensland, Australia, May 1979.Google Scholar
Index Terms
- A sublinear additive sieve for finding prime number
Recommendations
Some new upper bounds on the generation of prime numbers
Given an integer N, what is the computational complexity of finding all the primes less than N? A modified sieve of Eratosthenes using doubly linked lists yields an algorithm of OA(N) arithmetic complexity. This upper bound is shown to be equivalent to ...
The pseudosquares prime sieve
ANTS'06: Proceedings of the 7th international conference on Algorithmic Number TheoryWe present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp> n/(π(p)(logn)2); here π(x) is the prime counting function. Our algorithm requires only O(π(p)n) arithmetic ...
On the total number of prime factors of an odd perfect number
We say n ∈ N is perfect if σ(n) = 2n, where σ(n) denotes the sum of the positive divisors of n. No odd perfect numbers are known, but it is well known that if such a number exists, it must have prime factorization of the form n = pα Φj=1k qj2βj, where p,...
Comments