Contribution and Reservation

(29·10²⁰³+61)/9 =: 3(2)₂₀₂9_<204>; = 2531 · 14143 · 178813 · 321005026027141_<15> · 914108158461705983_<18> · 29250757178049444505577129_<26> · [5865110280112024589875592931491103149597283302369395522615446862463735209218207169949343690941344264536303528123728681781244195706623_<133>] SUBMIT/RESERVE

Status

Expression:	(29·10²⁰³+61)/9
Composite Factor:	586511028011202458987559293149110314959728330236939552261544 686246373520921820716994934369094134426453630352812372868178 1244195706623 (133-digit)
Status:	Not factored. Not reserved. You can submit its factors or reserve it for submitting in the future.

How to factor it

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 205.86-digit and the GNFS difficulty is 132.77-digit. GNFS must be faster than SNFS. It will take about 9 CPU-days to factor this composite number on 64-bit Opteron-2600MHz.

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

32229_203.poly ^*1

# Murphy_E = 5.172057e-11, selected by Jeff Gilchrist
n: 5865110280112024589875592931491103149597283302369395522615446862463735209218207169949343690941344264536303528123728681781244195706623
Y0: -42392166806471181055402032
Y1: 540883127374777
c0: 3746853529432020416406806211329095
c1: 137579291536842721822750187
c2: -120489443723064925804621
c3: -74623527199268735
c4: -10487622582
c5: 42840
skew: 854949.78
type: gnfs
# selected mechanically
rlim: 11600000
alim: 11600000
lpbr: 28
lpba: 28
mfbr: 54
mfba: 54
rlambda: 2.6
alambda: 2.6

*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;

Efforts by ECM

The efforts by ECM to find small factors of this 133-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)

Level	B1	Reported runs Total / Required runs (Required runs for lower level)	Name
40	3e6	2336	Wataru Sakai	Apr 27, 2009
40	3e6	2336 / 2336
45	11e6	0 / 3962
45	11e6	/ 3962
50	43e6	0 / 7465 (1130)
50	43e6	/ 7465 (1130)
55	11e7	0 / 17751 (3097)
55	11e7	/ 17751 (3097)
60	26e7	0 / 42014 (7636)
60	26e7	/ 42014 (7636)

Command line to find prime factors up to about 45-digit

echo 5865110280112024589875592931491103149597283302369395522615446862463735209218207169949343690941344264536303528123728681781244195706623 | ecm -n -c 3962 11e6

Command line to find prime factors up to about 50-digit

echo 5865110280112024589875592931491103149597283302369395522615446862463735209218207169949343690941344264536303528123728681781244195706623 | ecm -n -c 7465 43e6

Command line to find prime factors up to about 55-digit

echo 5865110280112024589875592931491103149597283302369395522615446862463735209218207169949343690941344264536303528123728681781244195706623 | ecm -n -c 17751 11e7

Command line to find prime factors up to about 60-digit

echo 5865110280112024589875592931491103149597283302369395522615446862463735209218207169949343690941344264536303528123728681781244195706623 | ecm -n -c 42014 26e7

Contribution and Reservation

Status

How to factor it

ECM, P-1, P+1

GNFS

See also

Efforts by ECM

Submit polynomial for GNFS

Submit factors

Make reservation