Contribution and Reservation

3·10¹⁹⁰+7 =: 3(0)₁₈₉7_<191>; = 37 · 12023821039_<11> · 24740182686490123_<17> · 834345923564404036855216234597229_<33> · [3266840841063151058420879085287406367732093771133291648378125740962470904735039604161264439172945385996578548253451059715354049947_<130>] (Makoto Kamada / GMP-ECM 6.1.2 B1=250000, sigma=718876711 for P33 / Sep 1, 2007) SUBMIT/RESERVE

Status

Expression:	3·10¹⁹⁰+7
Composite Factor:	326684084106315105842087908528740636773209377113329164837812 574096247090473503960416126443917294538599657854825345105971 5354049947 (130-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.48-digit and the GNFS difficulty is 129.51-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 30007_190.
Put the following polynomial file 30007_190.poly in there too.
And then, run "perl factMsieve.pl 30007_190".

30007_190.poly ^*1

# Murphy_E = 7.90429e-11, selected by Jeff Gilchrist
n: 3266840841063151058420879085287406367732093771133291648378125740962470904735039604161264439172945385996578548253451059715354049947
Y0: -9080301456770988916836882
Y1: 188959493757617
c0: -507672440029235748477026160029075
c1: 7269192220397240716415596321
c2: -19001601296387986080923
c3: -65778446313196129
c4: 39856705462
c5: 52920
skew: 573252.62
type: gnfs
# selected mechanically
rlim: 9500000
alim: 9500000
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 130-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	May 2, 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 3266840841063151058420879085287406367732093771133291648378125740962470904735039604161264439172945385996578548253451059715354049947 | ecm -n -c 3962 11e6

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

echo 3266840841063151058420879085287406367732093771133291648378125740962470904735039604161264439172945385996578548253451059715354049947 | ecm -n -c 7465 43e6

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

echo 3266840841063151058420879085287406367732093771133291648378125740962470904735039604161264439172945385996578548253451059715354049947 | ecm -n -c 17751 11e7

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

echo 3266840841063151058420879085287406367732093771133291648378125740962470904735039604161264439172945385996578548253451059715354049947 | 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