352^49-1

  Henrik Olsen announces the complete factorization of the number
N=(352^49-1)/(352^7-1) from The Expanded Cunningham Table by the
Special Number Field Sieve (SNFS).  It was previously known that

        N = c107

where c is a 107 digit composite number given by

 c107 = 9011391667106242619845214442383112590799
	5217161334478163286067487802913202327336
	673992807115076210463342593

The two polynomials used were

        X^6 + X^5 + X^4 + X^3 + X^2 + X + 1 and
        X - 352^7

with common root 352^7 (mod N).

  The region sieved was b < 150000 and |a| < 262144.
A factorbase size of 100000 and large prime bound of
20M was used for both polynomials.

  The linear algebra stage took 2.5 CPU hours on a
350MHz P-II using about 43MB of memory, the square
root stage took 20 minutes and found the factorisation
by combining the first two dependencies checked.

  On May 3, 2000 it was found that c107 = p33 * p36 * p39

  p33 = 965769556344371875680840005952217

  p36 = 542663723517112087844330756281417201

  p39 = 171944213326624483700958981994134331129

My NFSNET page
NFSNET homepage
Andy Steward's list
Cunningham Project homepage