Prime factors k.2n + 1 of Fermat numbers Fm and complete factoring status Compiled by Wilfrid Keller Prime Fermat numbers Completely factored Fermat numbers Factorizations known to be incomplete Composite cofactors Composite Fermat numbers without known factor Prime factors of larger Fermat numbers Summary of factoring status Count of factors according to difference n - m Known search limits ...

Appendix 1. Factorization results since 04 August 1997 - 2, 000 Abstract (Japanese version is here.) These are factorization results of various kind of numbers. I started this project (factorize various numbers under 100 digits) on 1991 using 80286 PC with 80386 (8 MHz) board. Used tools were UBASIC's factorization program (RHO, ECMX, MPQSX). Target numbers are, primorial +/- 1 (products of ...

Factorizations of Cyclotomic Numbers since 21 January 1999 - 20, 000 Whatsnew, history, errata (August 14, 2002) (These results are updating so frequently. Please check every day.) These numbers are under computing. (August 14, 2002) (To avoid duplication, please check above numbers.) old log ('02/05..09) old log ('02/01..04) old log ('01/09..12) old log ('01/05..08) old log ('01/01..04) old log ...

Fibonacci and Lucas Factorizations Below are tables of known factorizations of Fibonacci numbers, Fn, and Lucas numbers, Ln, for n Small tables of Fibonacci factorizations n n (144K) Small tables of Lucas factorizations n n (136K) The first composite holes are at F851 and L842. Composite factors are indicated by (C) following the factor. The compact big tables Format of tables Fibonacci (223K) ...

Factors for 2n-1 and 2n+1 for 1200 n 10000: List of factors in the Prime95 lowp.txt file format for: Factors for 2^n+1, 1200 Factors for 2^n+1, 1200 for n multiple of four Factors for 2^n-1, 1200 Factors for 2^n-1, for very large prime n, O(107) RELATED SITES: Cunningham Project; ECMNET; GIMPS; Brents table; Factor World. Hitbox counter ...

Interesting problem about products of two primes of the same size.

Factors of numbers of the form 4^(3^n)+2^(3^n)+1 and 4^(3^n)-2^(3^n)+1.