1. Arithmetic progressions that consist only of primes;Grosswald, Emil;J. Number Theory,1982
2. Problem Books in Mathematics;Guy, Richard K.,1981
3. Canadian Number Theory Association unsolved problems 1988;Guy, Richard K.,1990
4. A. Moran and P. A. Pritchard, The design of a background job on a local-area network, Proceedings 14th Australian Computer Science Conference (G. Gupta, ed.), Australian Computer Science Communications 13 (1991), 17-1-17-11.
5. A case study of number-theoretic computation: searching for primes in arithmetic progression;Pritchard, Paul A.;Sci. Comput. Programming,1983