Prime Numbers

REFERENCES 549
[Bach and Shallit 1996] E. Bach and J. Shallit. Algorithmic Number Theory,
volume I. MIT Press, 1996.
[Baillie and Wagstaff 1980] R. Baillie and S. Wagstaff, Jr. Lucas pseudoprimes.
Math. Comp., 35:1391–1417, 1980.
[Bailey 1990] D. Bailey. FFTs in external or hierarchical memory. J. Supercomp.,
4:23–35, 1990.
[Bailey and Crandall 2001] D. Bailey and R. Crandall. On the random character of
fundamental constant expansions, Experiment. Math., 10:175–190, 2001.
[Bailey and Crandall 2002] D. Bailey and R. Crandall. Random generators and
normal numbers. Experiment. Math., 11:527–546, 2002.
[Bailey et al. 2003] D. Bailey, J. Borwein, R. Crandall, and C. Pomerance. On the
binary expansions of algebraic numbers. Journal de Theorie des Nombres,
Bordeau (to appear), 2003.
[Balasubramanian and Nagaraj 1997] R. Balasubramanian and S. Nagaraj.
Density of Carmichael numbers with three prime factors. Math. Comp.,
66:1705–1708, 1997.
[Balazard et al. 1999] M. Balazard, E. Saias, and M. Yor. Notes sur la fonction ζ
de Riemann. II. Adv. Math., 143:284–287, 1999.
[Balog 1989] A. Balog. On a variant of the Piatetski-Shapiro prime number
theorem. In Groupe de travail en théorie analytique et élementaire des
nombres, 1987–1988, volume 89-01 of Publ. Math. Orsay, pages 3–11.
Univ. Paris XI, Orsay, 1989.
[Barrett 1987] P. Barrett. Implementing the Rivest Shamir and Adleman public
key encryption algorithm on a standard digital signal processor. In
A. Odlyzko, editor, Advances in Cryptology, Proc. Crypto ’86, volume 263
of Lecture Notes in Computer Science, pages 311–323. Springer–Verlag,
1987.
[Bateman et al. 1989] P. Bateman, J. Selfridge, and S. Wagstaff, Jr. The new
Mersenne conjecture. Amer. Math. Monthly, 96:125–128, 1980.
[Bays and Hudson 2000a] C. Bays and R. Hudson. Zeroes of Dirichlet L-functions
and irregularities in the distibution of primes. Math. Comp., 69:861–866,
2000.
[Bays and Hudson 2000b] C. Bays and R. Hudson. A new bound for the smallest
x with π(x) > li (x). Math. Comp., 69:1285–1296, 2000.
[Bernstein 1997] D. Bernstein. Multidigit multiplication for mathematicians, 1997.
em Advances Appl. Math., to appear. http://cr.yp.to/arith.html#m3.
[Bernstein 1998] D. Bernstein. Bounding smooth integers (extended abstract). In
[Buhler 1998], pages 128–130.
[Bernstein 2003] D. Bernstein. Proving primality in essentially quartic time.
http://cr.yp.to/ntheory.html#quartic.
[Bernstein 2004a] D. Bernstein. Scaled remainder trees.
http://cr.yp.to/papers.html#scaledmod.