Great strides have been made in recent years in the search for ever larger prime Generalized Fermat Numbers (GFN). We briefly review the history of the GFN prime search, and describe new implementations of the 'Genefer' software (now available as open source) using CUDA and optimised CPU assembler which have underpinned this unprecedented progress. The results of the ongoing search are used to extend Gallot and Dubner's published tables comparing the theoretical predictions with actual distributions of primes, and we report on recent discoveries of GFN primes with over one million digits. © 2014 Springer-Verlag.
CITATION STYLE
Bethune, I., & Goetz, M. (2014). Extending the generalized Fermat prime number search beyond one million digits using GPUs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8384 LNCS, pp. 106–113). Springer Verlag. https://doi.org/10.1007/978-3-642-55224-3_11
Mendeley helps you to discover research relevant for your work.