Contribution and Reservation

(10²²⁹+53)/9 =: (1)₂₂₈7_<229>; = 7 · 4013 · 21080214199123782827334904246489_<32> · [1876356133953640506822053967773074005663647709224374242959845441038980287292994105040158088923184539551392048889349169561984324490547319339771678501378682355721969287530319310154004137674806383_<193>] (Makoto Kamada / GMP-ECM 6.2.1 B1=25e4, sigma=1683657022 for P32 / Jan 30, 2009) SUBMIT/RESERVE

Status

Expression:	(10²²⁹+53)/9
Composite Factor:	187635613395364050682205396777307400566364770922437424295984 544103898028729299410504015808892318453955139204888934916956 198432449054731933977167850137868235572196928753031931015400 4137674806383 (193-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.

SNFS

Use GGNFS and/or Msieve if GMP-ECM cannot find a factor. The SNFS difficulty of this composite number is 229.00-digit and the GNFS difficulty is 192.27-digit. SNFS must be faster than GNFS. It will take about 179 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 11117_229.
Put the following polynomial file 11117_229.poly in there too.
And then, run "perl factMsieve.pl 11117_229".

11117_229.poly ^*1

n: 1876356133953640506822053967773074005663647709224374242959845441038980287292994105040158088923184539551392048889349169561984324490547319339771678501378682355721969287530319310154004137674806383
m: 100000000000000000000000000000000000000
deg: 6
c6: 10
c0: 53
skew: 1.32
type: snfs
lss: 1
rlim: 46000000
alim: 46000000
lpbr: 30
lpba: 30
mfbr: 59
mfba: 59
rlambda: 2.7
alambda: 2.7

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

Efforts by ECM

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

Level	B1	Reported runs Total / Required runs (Required runs for lower level)	Name
30	25e4	430	Makoto Kamada	Feb 1, 2009
30	25e4	430 / 430
35	1e6	0 / 825
35	1e6	/ 825
40	3e6	0 / 2336 (294)
40	3e6	/ 2336 (294)
45	11e6	0 / 4479 (677)
45	11e6	/ 4479 (677)
50	43e6	0 / 7553 (1277)
50	43e6	/ 7553 (1277)

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

echo 1876356133953640506822053967773074005663647709224374242959845441038980287292994105040158088923184539551392048889349169561984324490547319339771678501378682355721969287530319310154004137674806383 | ecm -n -c 825 1e6

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

echo 1876356133953640506822053967773074005663647709224374242959845441038980287292994105040158088923184539551392048889349169561984324490547319339771678501378682355721969287530319310154004137674806383 | ecm -n -c 2336 3e6

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

echo 1876356133953640506822053967773074005663647709224374242959845441038980287292994105040158088923184539551392048889349169561984324490547319339771678501378682355721969287530319310154004137674806383 | ecm -n -c 4479 11e6

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

echo 1876356133953640506822053967773074005663647709224374242959845441038980287292994105040158088923184539551392048889349169561984324490547319339771678501378682355721969287530319310154004137674806383 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers