1967 H. Aboud: The greatest prime divisor of an arithmetic sequence.
Vestnik Mosk. Univ. Mat. 44/6 (1989), 3-7.

11509 William Adams/Daniel Shanks: Strong primality tests that are not
sufficient. Math. Comp. 39 (1982), 255-300.

L. Adleman/M. Huang: Primality testing and abelian varieties over finite 
fields. SLN Math. 1512 (1992).

11506 Leonard Adleman/Carl Pomerance/Robert Rumely: On distinguishing
prime numbers from composite numbers. Annals Math. 117 (1983), 173-206.

17713 Manindra Agrawal/Neeraj Kayal/Nitin Saxena: Primes is in P.
Ann. Math. 160 (2004), 781-793.

1755 P. Alexandrov (ed.): Die Hilbertschen Probleme. Leipzig 1983.

R. Alford/A. Granville/Carl Pomerance: There are infinitely many Carmichael
numbers. Annals of Math. 140 (1994), 1-20.

17840 Eleonora Andreotti: Esistono infinite progressioni aritmetiche di
numeri primi di lunghezza k per ogni intero positivo.
Elaborazione di una conferenza sul teorema di Green-Tao. Aprile 2006, 14p.

A. Atkin/F. Morain: Elliptic curves and primality proving. 
INRIA Rocquencourt, Rapp. Rech. 1256 (1990).

P. Bateman/John Selfridge/S. Wagstaff: The new Mersenne conjecture.
Amer. Math. Monthly 96/2 (1989), 125-128.

4074 Christoph Baxa: Ueber Gandhis Primzahlformel.
El. Math. 47 (1992), 82-84. [7922]

3071 Maria Bedendo: La dimostrazione elementare del teorema dei numeri primi. 
Tesi, Ferrara 1989.

2001 Edmondo Bedocchi: Nota ad una congettura sui numeri primi.
Riv. Mat. Univ. Parma 11 (1985), 229-236.

20982 Annabell Berger: Der Primzahltest von Agrawal-Kayal-Saxena
im Vergleich zum Primzahltest von Rabin-Miller.
Bachelorarbeit Fernuniversität Hagen, 2004, 43p.

20978 Daniel Bernstein: Proving primality after Agrawal-Kayal-Saxena.
Internet 2004, 15p.

A. Blanchard: Introduction a' la theorie analytique des nombres premiers.
Dunod 1969.

20119 Valentin Blomer: The theorem of Green-Tao.
EMS Newsletter March 2008, 13-16.

17752 Folkmar Bornemann: Ein Durchbruch für jedermann. DMV Mitt. 2004/2, 14-21.
On the primality test in P discovered by Agrawal, Kayal and Saxena.

17751 Folkmar Bornemann/Günter Ziegler: Die Beweise des Sommers.
DMV-Mitt. 12/3 (2004), 181-183.

7746 D. Borwein/J. Borwein/P. Borwein/R. Girgensohn: Giuga's conjecture
on primality. Am. Math. Monthly (1996), 40-50.

3572 David Bressoud: Factorization and primality tests. Springer 1989.

John Brillhart/D. H. Lehmer/John Selfridge: New primality criteria and 
factorizations of 2^m +/- 1. Math. Comp. 29/130 (1975), 620-647.

R. Carmichael: On composite numbers p which satisy the Fermat congruence 
a^(p-1)==1 (mod p). Am. Math. Monthly 19 (1912), 22-27.

5814 Paolo Codeca'/Luciano Biasini/Gaetano Zanghirati: Implementazione di 
tests probabilistici di primalita'. Ann. Univ. Ferrara 38 (1992), 117-132.

14472 Henri Cohen: Zahlentheoretische Aspekte der Kryptographie.
Informatik-Spektrum Juni 2001, 129-139.

11507 Henri Cohen/H. Lenstra: Primality testing and Jacobi sums.
Math. Comp. 42 (1984), 297-330.

D. Cox: Primes of the form x^2+ny^2. Fermat, class field theory and complex 
multiplication. Wiley 1989, 350p. Pds. 35.

20297 David Cox: Visualizing the sieve of Eratosthenes.
Notices AMS May 2008, 579-582.

19112 Richard Crandall/Carl Pomerance: Prime numbers. Springer 2005, 600p. Eur 62.

1929 Harold Davenport: Multiplicative number theory. Springer 1980.

7861 M. Deleglise/J. Rivat: Computing \pi(x): The Meissel, Lehmer, Lagarias,
Miller, Odlyzko method. Math. Comp. 65 (1996), 235-245.

16648 John Derbyshire: Prime obsession. Plume 2004, 410p. $11.

362 H. Diamond: Elementary methods in the study of the distibution of prime 
numbers. Bull. AMS 7 (1982), 553-589.

357 J. Dixon: Factorization and primality tests.
Am. Math. Monthly 91 (1984), 333-352.

H. Dubner/H. Nelson: Seven consecutive primes in arithmetic progression.
Math. Comp. ... (1997), ...

H. Duparc: On Carmichael numbers. Simon Stevin 29 (1952), 21-24.
Cfr. MR 14 (1953), 21.

361 William Ellison/Fern Ellison: Prime numbers. Wiley 1985.

Paul Erdo''s: On pseudoprimes and Carmichael numbers.
Publ. Math. Debrecen 4 (1956), 201-206.

Benjamin Fine/Gerhard Rosenberger: Number theory - an introduction
via the distribution of primes. Birkhäuser 2006, 320p. $50.

8760 Tony Forbes: Large prime triples.
Mail to nmbrthry@listserv.nodak.edu, 6 December 1996, 2p.

2052 G. Fung/H. Williams: Quadratic polynomials which have a high density of 
prime values. Math. Computation 55 (1990), 345-353.

5493 Peter Giblin: Primes and programming. Cambridge UP 1993.

G. Giuga: Su una presumibile proprieta' caratteristica dei numeri primi.
Ist. Lombardo Sci. Lett. Rend. A 83 (1950), 511-528.

S. Goldwasser/J. Kilian: Almost all primes can be quickly certified.
Proc. 18th STOC (Berkeley) (1986), 316-329.

D. Gordon: On the number of elliptic pseudoprimes.
Math. Comp. 52 (1989), 231-245.

16676 Andrew Granville: It is easy to determine whether a given integer is prime.
Bull. AMS 42/1 (2004), 3-38.

20985 Andrew Granville: Prime number patterns. Am. Math. Monthly 115 (2008), 279-296.

E. Grassini: I numeri composti m che verificano la congruenza di Fermat
(a^{m-1}=1, mod m). Period. Mat. 43 (1965), 183-208.

17068 Ben Green: Linear equations in the primes: past, present and future.
Internet 2005, 15p.

17069 Ben Green/Terence Tao: The primes contain arbitrarily long
arithmetic progressions. Ann. Math. 167 (2008), 481-547.

A. Guthmann: Primzahltests und Pseudoprimzahlen.
Bayreuther Math. Schr. 21 (1986), 101-116.

1994 R. Guy/C. Lacampagne/John Selfridge: Primes at a glance.
Math. Computation 48 (1987), 183-202.

16626 Julian Havil: Gamma. Exploring Euler's constant. Princeton UP 2003, 260p. $21.

1908 D. Heath-Brown: Differences between consevutive primes.
Jber. DMV 90 (1988), 71-89.

7863 Edmund Hlawka: Erinnerungen an Karl Prachar. Monatshefte 121 (1996), 1-9.

1880 Loo-Keng Hua: Additive Primzahltheorie. Leipzig 1959.

A. Ingham: On two conjectures in the theory of numbers.
Am. J. Math. 64 (1942), 313-319.

2050 G. Jaeschke: The Carmichael numbers to10^12.
Math. Computation 55 (1990), 383-389.

G. Jameson: The prime number theorem. Cambridge UP, 260p. Pds. 19.

20663 James Jones/Daihachiro Sato/Hideo Wada/Douglas Wiens: Diophantine
representation of the set of prime numbers.
Am. Math. Monthly 83 (1976), 449-464.

W. Jurkat/A. Peyerimhoff: A constructive approach to Kronecker
approximations and its application to the Mertens conjecture.
J. reine u. angew. Math. 286/287 (1976), 322-340.

20980 Ian Kiming: Cryptography supplements. Internet 2008, 28p.
Contains a proof of the AKS primality test.

9756 Peter Kiss/Bui Minh Phong/Erik Lieuwens: On Lucas pseudoprimes
which are products of s primes.
In 9745 Philippou/Bergum/Horadam, 131-139.

Knopfmacher: Abstract analytic number theory.
Dover. 0-486-66344-2. $ 10.

Gerd Kowol: Primzahlen. Phil.-Anthrop. Verlag, Dornach 1995, 170p. DM 37.

17677 Bryna Kra: The Green-Tao theorem of arithmetic progressions in the primes -
an ergodic point of view. Bull. AMS 43/1 (2006), 3-23.

8586 Evangelos Kranakis: Primality and cryptography. DM 50.

7812 Martin Kutrib/Joerg Richstein: Primzahlen - Zwillinge aus dem 
Parallelrechner. Spektrum 1996/2, 26-31. Das Sieb des Eratosthenes eignet
sich recht gut zur Parallelisierung.

363 Edmund Landau: Handbuch der Lehre von der Verteilung der Primzahlen. 
Chelsea 1974.

H. Lenstra: Factoring integers with elliptic curves.
Annals Math. 126 (1987), 649-673.

20979 H. Lenstra/Carl Pomerance: Primality testing with Gaussian periods.
Internet 2005, 45p.

Norman Levinson: A motivated account of an elementary proof of the prime 
numbers. Am. Math. Monthly 76 (1969), 225-245. The most elementary of the 
elementary proofs.

Gu''nter Loh: Long chains of nearly doubled primes.
Math. Comp. 53 (1989), 751-759.

Yu. Matijasevich: Diophantine representation of the set of prime numbers. 
Dokl. Akad. Nauk SSSR 196 (1971), 770-773. Russian.

2056 C. Matthews: Matrix prime number theorems.
Proc. Japan Ac. 65 A (1989), 336-339.

20187 Barry Mazur: Finding meaning in error terms.
Bull. AMS 45/2 (2008), 185-228.

1977 A. Mercier: Relations between \omega(n) and \Omega(n).
Am. Math. Monthly 97 (1990), 503-505. [3323]

Gary Miller: Riemann's hypothesis and tests for primality.
J. Comp. Sys. Sci. 13 (1976), 300-317.

1945 Hugh Montgomery: Topics in multiplicative number theory.
SLN Math. 227 (1986).

F. Morain: Distributed Primality Proving and the primality of (2^{3539}+1)/3.
Proc. EUROCRYPT'90, Springer LN Comp. Sci. 473 (1991), ...

1937 Yoichi Motohashi: Sieve methods and prime number theory.
Springer 1983.

7196 Helmut Mueller: Primzahltests und elliptische Kurven.
10^99+289 ist prim. Mitt. Math. Ges. Hamburg 13 (1993), 155-177.

M. Nair: On Chebyshev-type inequalities for primes.
Am. Math. Monthly 89 (1982), 126-129.

G. Neubauer: Eine empirische Untersuchung zur Mertensschen Funktion.
Num. Math. 5 (1963), 1-13.

Andrew Odlyzko/Herman Riele: Disproof of the Mertens conjecture.
J. reine und angew. Math. 357 (1985), 138-160.

4549 Herbert Pieper: Zahlen aus Primzahlen. Birkhäuser 1984.

7403 R. Pinch: Some primality testing algorithms.
Notices AMS November 1993, ..., or Internet 1993, 12p.

17067 Christoph Pöppe: Arithmetische Primzahlfolgen beliebiger Länge.
Spektrum 2005/4, 114-117. Ben Green und Terence Tao haben bewiesen, daß es
arithmetische Folgen beliebiger Länge gibt, die nur aus Primzahlen bestehen.
Die längste bekannte derartige Folge wurde von Markus Frind, Paul Jobling und
Paul Underwood gefunden; sie besteht aus den 23 Primzahlen
56211383760397 + 44546738095860 k für k=0,...,22.

358 Carl Pomerance: Very short primality proofs. 
Math. of Computation 48 (1987), 315-322.

20984 Carl Pomerance: Primality testing - variations on a theme of Lucas.
Internet 2009, 9p.

Carl Pomerance/R. Crandall: Primes.
Springer 1999, 350p. 3-540-94777-9. DM 98.

11508 Carl Pomerance/John Selfridge/Samuel Wagstaff: The pseudoprimes
to 25*10^9. Math. Comp. 35 (1980), 1003-1026.

411 Karl Prachar: Primzahlverteilung. Springer 1957.

7889 Karl Prachar: Bemerkungen ueber Primzahlen in kurzen Reihen.
Acta Arithm. 44 (1984), 175-180.

M. Rabin: Probabilistic algorithm for testing primality.
J. Number Theory 12 (1980), 128-138.

15982 Paulo Ribenboim: 1093. Boll. UMI Mat. Soc. Cult. 6/A (2003), 165-182.
1093 is the smallest prime p with the property that 2^{p-1} is congruent
to 1 mod p^2.

Paulo Ribenboim: The little book of bigger primes. Springer 2004, 350p. Eur 50.

20682 Paulo Ribenboim: Die Welt der Primzahlen. Springer 2006, 360p. Eur 30.

Herman te Riele: Some historical and other notes about the Mertens
conjecture and its recent disproof. Nieuw Arch. Wisk. 3 (1985), 237-243.

17714 Sara Robinson: Fast deterministic algorithm for primality testing.
History of the Agrawal-Kayal-Saxena primality test.

Dan Rockmore: Stalking the Riemann hypothesis. Pantheon 2005, 300p. $17.
A non-technical historical account.

J. Rosser/L. Schoenfeld: Approximate formulas for some functions of prime 
numbers. Ill. J. Math. 6 (1962), 64-94.

O. Sacks: The man who mistook his wife for a hat.
Picador, London 1986. Probably a book on autistic persons. Contains the story
of autistic twins John and Michael, who were able to recognize large primes
(of 6 to 10 digits) simply by looking at them. Reference found in Peter 
Giblin's book "Primes and programming" (Cambridge UP 1993).

20981 Rene' Schoof: Four primality testing algorithms. Internet 2008, 26p.
Contains a proof of the AKS primality test.

5740 Wolfgang Schwarz: Der Primzahlsatz. 5738 Laugwitz, 35-61.

410 Wolfgang Schwarz: Einfuehrung in Methoden und Ergebnisse der 
Primzahltheorie. Bibl. Inst. 1969.

409 Wolfgang Schwarz: Über einige Probleme aus der Theorie der Primzahlen.
Steiner 1985.

M. Shai Haran: The mysteries of the real prime. Oxford UP 2001, 250p. Pds. 45.

4806 Harold Stark: Galois theory, algebraic number theory, and zeta functions. 
4740 Waldschmidt, 313-393.

G. Tenenbaum: Introduction to analytic and probabilistic number theory.
Cambridge UP 1995, 450p. 0-521-41261-7. Pds. 45.

G. Tenenbaum/M. Mendes-France: Les nombres premiers.
Presses Univ. France 1997, 130p. 2-13-048399-2. FF 42.
"In diesem Büchlein wird auf knappen 127 Seiten ein erstaunlich
tiefgehender Überblick über die analytische Primzahltheorie
gegeben ... Es ist ein großer Genuß, in diesem Buch zu schmökern."
(M. Drmota)

1895 Ernst Trost: Primzahlen. Birkhaeuser 1968.

20983 Tobias Tscheuschner: Der Primzahltest von Agrawal, Kayal und Saxena.
Internet 2003, 9p.

18140 Yuri Tschinkel: About the cover - on the distribution of primes -
Gauss' tables. Bull. AMS 43/1 (2006), 89-91.

R. Vaughan: Mean value theorems in prime number theory.
J. LMS 10 (1975), 153-162.

R. Vaughan: An elementary method in prime number theory.
Acta Arithm. 37 (1980), 111-115.

14407 Johann Wiesenbauer: Primzahltests und Faktorisierungsalgorithmen I.
IMN 186 (2001), 9-23.

5022 Juergen Wolfart: Primzahltests und Primfaktorzerlegung.
2687 Chatterji/, 161-188.

2046 Dieter Wolke: Ueber die Primteiler-Anzahl \omega(n).
Monatshefte Math. 110 (1990), 73-78. [3323]

1969 D. Wolke: Ueber die zahlentheoretische Funktion \omega(n).
Acta Arithmetica 55 (1990), 323-331. [3323]

1970 J. Wu: Sur la suite des nombres premiers jumeaux. 
Acta arithmetica 55 (1990), 365-394.

1972 Ti Zuo Xuan: The average order of d(k,n) over integers free of large
prime factors. Acta Arithmetica 55 (1990), 249-260. [3323]

19245 Alessandro Zaccagnini: Primes in almost all short intervals.
Acta Arithmetica 84/3 (1998), 225-244.

19297 Alessandro Zaccagnini: Introduzione alla teoria analitica
dei numeri. Corso Univ. Parma 2006, 53p.

Don Zagier: Die ersten 50 Millionen Primzahlen. 1847 Borho, 39-73. 

Gaetano Zanghirati: Congruenze, classi di resti e tests probabilistici di 
primalita'. Tesi, Ferrara 1991.

Hans Zassenhaus: Ueber die Existenz von Primzahlen in arithmetischen 
Progressionen. Comm. Math. Helv. 22 (1949), 232-259. The first elementary 
proof of Dirichlet's theorem.