Prime Numbers

REFERENCES 551
[Borwein and Borwein 1987] J. Borwein and P. Borwein. Pi and the AGM: A
Study in Analytic Number Theory and Computational Complexity. John
Wiley and Sons, 1987.
[Borwein et al. 2000] J. Borwein, D. Bradley, and R. Crandall. Computational
strategies for the Riemann zeta function. J. Comp. App. Math.,
121:247–296, 2000.
[Bosma and van der Hulst 1990] W. Bosma and M.-P. van der Hulst. Primality
proving with cyclotomy. PhD thesis, University of Amsterdam, 1990.
[Bosselaers et al. 1994] A. Bossalaers, R. Govaerts, and J. Vandewalle.
Comparison of three modular reduction functions. In D. Stinson, editor,
Advances in Cryptology, Proc. Crypto ’93, volume 773 in Lecture Notes in
Computer Science, pages 175–186. Springer–Verlag, 1994.
[Boyle et al. 1995] P. Boyle, M. Broadie, and P. Glasserman. Monte Carlo
methods for security pricing. Unpublished manuscript, June 1995.
[Bratley and Fox 1988] P. Bratley and B. Fox. ALGORITHM 659: Implementing
Sobol’s quasirandom sequence generator. ACM Trans. Math. Soft.,
14:88–100, 1988.
[Bredihin 1963] B. Bredihin. Applications of the dispersion method in binary
additive problems. Dokl. Akad. Nauk. SSSR, 149:9–11, 1963.
[Brent 1979] R. Brent. On the zeros of the Riemann zeta function in the critical
strip. Math. Comp., 33:1361–1372, 1979.
[Brent 1994] R. Brent. On the period of generalized Fibonacci recurrences. Math.
Comp., 63:389–401, 1994.
[Brent 1999] R. Brent. Factorization of the tenth Fermat number. Math. Comp.,
68:429–451, 1999.
[Brent et al. 1993] R. Brent, G. Cohen, and H. te Riele. Improved techniques for
lower bounds for odd perfect numbers. Math. Comp., 61:857–868, 1993.
[Brent et al. 2000] R. Brent, R. Crandall, K. Dilcher, and C. van Halewyn. Three
new factors of Fermat numbers. Math. Comp., 69: 1297–1304, 2000.
[Brent and Pollard 1981] R. Brent and J. Pollard. Factorization of the eighth
Fermat number. Math. Comp., 36:627–630, 1981.
[Bressoud and Wagon 2000] D. Bressoud and S. Wagon. A Course in
Computational Number Theory. Key College Publishing, 2000.
[Brillhart et al. 1981] J. Brillhart, M. Filaseta, and A. Odlyzko. On an
irreducibility theorem of A. Cohn. Canad. J. Math., 33:1055–1059, 1981.
[Brillhart et al. 1988] J. Brillhart, D. Lehmer, J. Selfridge, B. Tuckerman, and
S. Wagstaff, Jr. Factorizations of b n ± 1, b =2, 3, 5, 6, 7, 10, 11, 12 up to
high powers. Second edition, volume 22 of Contemporary Mathematics.
Amer. Math. Soc., 1988.
[Bruin 2003] N. Bruin. The primitive solutions to x 3 + y 9 = z 2 .
http://arxiv.org/find/math/1/au:+Bruin N/0/1/0/all/0/1. J.
Number Theory, to appear.