Bibliography

1

Niven, I., Zuckerman, H. Montgomery, H. An introduction to the Theory of Numbers, Fifth Edition. John Wiley and Sons, New York, 1991. ISBN: 0-471-62546-9

2

Brent, R. P.; Cohen, G. L.; te Riele, H. J. J. Improved techniques for lower bounds for odd perfect numbers. Math. Comp. 57 (1991), no. 196, 857-868.

3

Hardy, G. H. and Wright, E.M. An Introduction to the Theory of Numbers, Fifth Edition, Oxford Science Publications, Oxford University Press, Oxford, 1979.

4

Knuth, D. E. Seminumerical Algorithms, The Art of Computer Programming Third Edition Volume 2 , Addison-Wesley, Reading, 1999.

5

Bressoud, David M. Factorization and Primality Testing, Undergraduate Texts in Mathematics, Springer, New York, 1989.

6

Pinch, R., The pseudoprimes up to ten trillion, http://www.chalcedon.demon.co.uk/p41.ps.

7

C. Pomerance, J.L. Selfridge, and S. S. Wagstaff, Jr., The pseudoprimes to $25\times 10^{9}$, Mathematics of Computation, 35(1980), 1003-1026.