Contribution and Reservation

ECM, P-1, P+1

Look for prime factors by GMP-ECM first. Refer to the section "Efforts by ECM". Not only ECM but also P-1/P+1 may be helpful.

NFS

Use GGNFS and/or Msieve if GMP-ECM cannot find a factor. The SNFS difficulty of this composite number is 193.30-digit and the GNFS difficulty is 152.84-digit. SNFS must be faster than GNFS. It will take about 12 CPU-days to factor this composite number on 64-bit Opteron-2600MHz.

Steps of SNFS

1. Put factMsieve.pl to which $GGNFS_BIN_PATH and $NUM_CPUS were modified properly in the working directory 19991_193.
2. Put the following polynomial file 19991_193.poly in there too.
3. And then, run "perl factMsieve.pl 19991_193".

n: 691933417297017957104478334368940847492681960800916503025598061193956200601528866970042838166170253705478669766997332550958436576230148828520831637814969
m: 100000000000000000000000000000000000000
deg: 5
c5: 2000
c0: -9
skew: 0.34
type: snfs
lss: 1
rlim: 11700000
alim: 11700000
lpbr: 28
lpba: 28
mfbr: 55
mfba: 55
rlambda: 2.5
alambda: 2.5

These parameters were not fully adjusted. The approximate expressions which were used for making the parameters are: deg=expt<=105?4:expt<=210?5:6 or expt<=144?4:6; d=log10(c[deg])+deg*log10(m)[digits]; time=10^(d/30-4)[hours]; skew=|c0/c[deg]|^(1/deg); rlim=round(7*10^(d/60+3)); lpbr=floor(d/25+21); mfbr=floor(d/8+31); rlambda=floor(d/25+18)/10;

See also

• How to contribute your factors

The efforts by ECM to find small factors of this 153-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 40-digit or more. Please report your efforts by ECM. (Anonymous reports are not acceptable)