Contribution and Reservation

7·10¹⁹³+9 =: 7(0)₁₉₂9_<194>; = 2744781851639_<13> · 2543717477743427269722428833_<28> · 2665128364816742128138476637_<28> · [3761864954913963305216285313826516722992973293912532948415624819300798599573925261366288009876980589923493602165953677693332011_<127>] SUBMIT/RESERVE

Status

Expression:	7·10¹⁹³+9
Composite Factor:	376186495491396330521628531382651672299297329391253294841562 481930079859957392526136628800987698058992349360216595367769 3332011 (127-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 195.24-digit and the GNFS difficulty is 126.58-digit. GNFS must be faster than SNFS. It will take about 4 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 70009_193.
Put the following polynomial file 70009_193.poly in there too.
And then, run "perl factMsieve.pl 70009_193".

70009_193.poly ^*1

# Murphy_E = 1.106139e-10, selected by Jeff Gilchrist
n: 3761864954913963305216285313826516722992973293912532948415624819300798599573925261366288009876980589923493602165953677693332011
Y0: -2681798075468550223350477
Y1: 65727034522909
c0: 7030854032314089557519814448112
c1: 879467878075130583205938177
c2: 8684027777830562069999
c3: -13882250473218267
c4: -42952054366
c5: 27120
skew: 392843.86
type: gnfs
# selected mechanically
rlim: 7900000
alim: 7900000
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 127-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	0 / 0
40	3e6	500	Erik Branger	Mar 17, 2009
		500 / 2336
		/ 1836
45	11e6	0 / 4368 (532)
45	11e6	/ 4368 (532)
50	43e6	0 / 7534 (1246)
50	43e6	/ 7534 (1246)
55	11e7	0 / 17766 (3126)
55	11e7	/ 17766 (3126)

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

echo 3761864954913963305216285313826516722992973293912532948415624819300798599573925261366288009876980589923493602165953677693332011 | ecm -n -c 1836 3e6

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

echo 3761864954913963305216285313826516722992973293912532948415624819300798599573925261366288009876980589923493602165953677693332011 | ecm -n -c 4368 11e6

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

echo 3761864954913963305216285313826516722992973293912532948415624819300798599573925261366288009876980589923493602165953677693332011 | ecm -n -c 7534 43e6

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

echo 3761864954913963305216285313826516722992973293912532948415624819300798599573925261366288009876980589923493602165953677693332011 | ecm -n -c 17766 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