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 206.76-digit and the GNFS difficulty is 145.53-digit. SNFS may be faster than GNFS. It will take about 33 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 64443_205.
2. Put the following polynomial file 64443_205.poly in there too.
3. And then, run "perl factMsieve.pl 64443_205".

n: 33676675639754159102560963900657923771839396511769809979019650751645259114030473449609934052331429089655384598629084690289443528850998721649949453
m: 100000000000000000000000000000000000000000
deg: 5
c5: 58
c0: -13
skew: 0.74
type: snfs
lss: 1
rlim: 19600000
alim: 19600000
lpbr: 29
lpba: 29
mfbr: 56
mfba: 56
rlambda: 2.6
alambda: 2.6

*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 146-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 30-digit or more. Please report your efforts by ECM. (Anonymous reports are not acceptable)