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.

GNFS

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

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

# Murphy_E = 1.580662e-10, selected by Jeff Gilchrist
n: 11955907219789388090396927468596102846705760576688639467787460136053127454112956393569754103555054189544180606793438498318517
Y0: -965904624584214002999227
Y1: 29757583127591
c0: -10062534597856893819796369537440
c1: 188270216174299077687152598
c2: -308953642659933419159
c3: -3444590731912942
c4: 12448625118
c5: 14220
skew: 302426.48
type: gnfs
# selected mechanically
rlim: 6800000
alim: 6800000
lpbr: 27
lpba: 27
mfbr: 52
mfba: 52
rlambda: 2.5
alambda: 2.5

*1 These parameters were not fully adjusted. The approximate expressions which were used for making the parameters are: d=log10(n); time=10^(d/21-4)[hours]; rlim=round(3*10^(d/37+3)); lpbr=floor(d/18+21); mfbr=floor(d/5+28); rlambda=floor(d/26+21)/10;

See also

• How to contribute your factors

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