[BB98] Borwein, Jonathan M. and Borwein, Peter B., Pi and the AGM, a study in analytic number theory and computational complexity.
John Wiley & Sons, New York, 1998.
[BB03] Borwein, Jonathan M. and Bailey, David H., Mathematics by Experiment: Plausible Reasoning in the 21st Century.
A K Peters, Nattick, MA, 2003.
[BBP97] Bailey, David, Borwein, Peter, and Plouffe, Simon, On the rapid computation of various polylogarithmic constants. Math. Comp.
[BC01] Bailey, David H. and Crandall, Richard E., On the random character of fundamental constant expansions. Experiment. Math.
[BHV01] Bilu, Yu., Hanrot, G., and Voutier, P. M., Existence of primitive divisors of Lucas and Lehmer numbers.With an appendix by M. Mignotte. J. Reine Angew. Math.
[BLS88] John Brillhart, Lehmer, D. H., Selfridge, J. L., Tuckerman, Bryant, and Wagstaff, S. S. Jr., Factorizations of bn
± 1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers.
second ed., American Mathematical Society, Providence, RI, 1988, (Third ed. available at http://www.ams.org/online_bks/conm22).
[Bre93] Brent, Richard P., On computing factors of cyclotomic polynomials. Math. Comp.
[Bro98] Broadhurst, D. J., Polylogarithmic ladders, hypergeometric series and the ten millionth digits of ζ(3) and ζ(5). Available at http://xxx.lanl.gov/abs/math/9803067, March 1998.
[Cha] Chamberland, Marc, Binary BBP-forumulas for logarithms, cyclotomic polynomials and Aurifeuillian identities. Draft of circa December, 2001, to appear.
[Coh93] Cohen, Henri, A course in computational algebraic number theory. Graduate Texts in Mathematics, 138, Springer-Verlag, Berlin, 1993.
[FBA99] Ferguson, Helaman R. P., Bailey, David H., and Arno, Steve, Analysis of PSLQ, an integer relation finding algorithm. Math. Comp.
[HW79] Hardy, G. H. and Wright, E. M., An introduction to the theory of numbers.
Fifth ed., Oxford University Press, Oxford, 1979.
[Knu98] Knuth, Donald E., The art of computer programming. vol. 2: Seminumerical algorithms, third ed., Addison-Wesley, Reading, Mass., 1998.
[Kob84] Koblitz, Neal, p-adic numbers, p-adic analysis, and zeta-functions.
Second ed., Graduate Texts in Mathematics, 58, Springer-Verlag, New York, 1984.
[NZM91] Niven, Ivan, Zuckerman, Herbert S., and Montgomery, Hugh L., An introduction to the theory of numbers.
Fifth ed., John Wiley & Sons, New York, 1991.
[Rib91] Ribenboim, Paulo, The little book of big primes.
Springer-Verlag, New York, 1991.
[Rib94] Ribenboim, Paulo, Catalan's conjecture: Are 8 and 9 the only consecutive powers?
Academic Press, Boston, MA, 1994.
[Rie94] Riesel, Hans, Prime numbers and computer methods for factorization.
Second ed., Birkhäuser, Boston, MA, 1994.
[Roi97] Roitman, Moshe, On Zsigmondy primes. Proc. Amer. Math. Soc.
[Sch74] Schinzel, A., Primitive divisors of the expression An – Bn in algebraic number fields. J. Reine Angew. Math.
[Wil98] Williams, Hugh C., Édouard Lucas and primality testing, Canadian Mathematical Society Series of Monographs and Advanced Texts, 22, John Wiley & Sons., New York, 1998.