Factorizations of Cunningham numbers with bases 13 to 99

2010/04/19 by Richard P. Brent, Brent, Richard P., Peter L. Montgomery +3
Computer Science · Mathematics · #11-04 (Secondary) #11Y05 (Primary) #Data Structures and Algorithms (cs.DS) #F.2.1 #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #acm:11-04 #acm:11Y05 #cs.DS #math.NT #msc:11-04 #msc:11Y05

paper · pdf · doi:10.48550/arxiv.1004.3169

A Technical Report (December 2000) not published elsewhere, submitted for archival reasons. vi + 463 pages. For further details see http://wwwmaths.anu.edu.au/~brent/pub/pub200.html

arxiv created 2010/04/20 · arxiv updated 2010/04/21

Abstract

This Report updates the tables of factorizations of aⁿ +- 1 for 13 < a < 100, previously published as CWI Report NM-R9212 (June 1992) and updated in CWI Report NM-R9419 (Update 1, September 1994) and CWI Report NM-R9609 (Update 2, March 1996). A total of 951 new entries in the tables are given here. The factorizations are now complete for n < 76, and there are no composite cofactors smaller than 10¹02.

Related

• A Computational Approach to Factoring Large Integers
• Mersenne Factorization Factory
• Constructing Carmichael numbers through improved subset-product algorithms
• The Carmichael numbers up to 10¹⁸
• Note on Integer Factoring Algorithms II