Contribution and Reservation

9·10¹⁸⁹-1 =: 8(9)₁₈₉_<190>; = 67 · 133187 · 2078087862871_<13> · 234621664993637_<15> · 5363095884001110231789672199_<28> · [385707683405733164444530365933755816046832242345670430607839333744882290009141947111896835408591178894659692587255754972460523547_<129>] (Sander Hoogendoorn / GMP-ECM) SUBMIT/RESERVE

Status

Expression:	9·10¹⁸⁹-1
Composite Factor:	385707683405733164444530365933755816046832242345670430607839 333744882290009141947111896835408591178894659692587255754972 460523547 (129-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 190.95-digit and the GNFS difficulty is 128.59-digit. GNFS must be faster than SNFS. It will take about 6 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 89999_189.
Put the following polynomial file 89999_189.poly in there too.
And then, run "perl factMsieve.pl 89999_189".

89999_189.poly ^*1

# Murphy_E = 8.856398e-11, selected by Jeff Gilchrist
n: 385707683405733164444530365933755816046832242345670430607839333744882290009141947111896835408591178894659692587255754972460523547
Y0: -5933603486256305043948835
Y1: 146527429911863
c0: 212232057908746287659700960864
c1: 25192863566366340002512412
c2: -165337970037718962496
c3: -20686967220190507
c4: 14676103272
c5: 52440
skew: 122292.82
type: gnfs
# selected mechanically
rlim: 9000000
alim: 9000000
lpbr: 28
lpba: 28
mfbr: 53
mfba: 53
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;

Efforts by ECM

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

Level	B1	Reported runs Total / Required runs (Required runs for lower level)	Name
35	1e6	904	Erik Branger	Jan 28, 2009
35	1e6	904 / 904
40	3e6	0 / 2104
40	3e6	/ 2104
45	11e6	0 / 4439 (610)
45	11e6	/ 4439 (610)
50	43e6	0 / 7548 (1266)
50	43e6	/ 7548 (1266)
55	11e7	0 / 17769 (3131)
55	11e7	/ 17769 (3131)

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

echo 385707683405733164444530365933755816046832242345670430607839333744882290009141947111896835408591178894659692587255754972460523547 | ecm -n -c 2104 3e6

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

echo 385707683405733164444530365933755816046832242345670430607839333744882290009141947111896835408591178894659692587255754972460523547 | ecm -n -c 4439 11e6

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

echo 385707683405733164444530365933755816046832242345670430607839333744882290009141947111896835408591178894659692587255754972460523547 | ecm -n -c 7548 43e6

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

echo 385707683405733164444530365933755816046832242345670430607839333744882290009141947111896835408591178894659692587255754972460523547 | ecm -n -c 17769 11e7

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