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.

SNFS

Use GGNFS and/or Msieve if GMP-ECM cannot find a factor. The SNFS difficulty of this composite number is 166.49-digit and the GNFS difficulty is 135.87-digit. SNFS must be faster than GNFS. It will take about 35 CPU-hours 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 68881_164.
2. Put the following polynomial file 68881_164.poly in there too.
3. And then, run "perl factMsieve.pl 68881_164".

n: 7453229079683634188103196101922610125639868950413398574507032854609890070168290130051336575627502110007583354854997020130458699173995831
m: 1000000000000000000000000000000000
deg: 5
c5: 31
c0: -355
skew: 1.63
type: snfs
lss: 1
rlim: 4200000
alim: 4200000
lpbr: 27
lpba: 27
mfbr: 51
mfba: 51
rlambda: 2.4
alambda: 2.4

*1 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 136-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)