The Pseudoprimes up to 1013

  • Richard G. E. Pinch
Conference paper

DOI: 10.1007/10722028_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1838)
Cite this paper as:
Pinch R.G.E. (2000) The Pseudoprimes up to 1013. In: Bosma W. (eds) Algorithmic Number Theory. ANTS 2000. Lecture Notes in Computer Science, vol 1838. Springer, Berlin, Heidelberg


There are 38975 Fermat pseudoprimes (base 2) up to 1011, 101629 up to 1012 and 264239 up to 1013: we describe the calculations and give some statistics. The numbers were generated by a variety of strategies, the most important being a back-tracking search for possible prime factorisations, and the computations checked by a sieving technique.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Richard G. E. Pinch
    • 1
  1. 1. Cheltenham, GlosU.K.

Personalised recommendations