Contribution and Reservation

(8·10¹⁹⁸-71)/9 =: (8)₁₉₇1_<198>; = 7 · 181 · 246151 · 26571308869211899069_<20> · 2181736485124043717540785640249_<31> · [49164770484616078662130837495285105615980477313414831637996342826393591225258796960761072524813073625782737476138348702108473214785930571753_<140>] (Serge Batalov / GMP-ECM 6.2.1 B1=3000000, sigma=2812342345 for P31 / Oct 21, 2008) SUBMIT/RESERVE

Status

Expression:	(8·10¹⁹⁸-71)/9
Composite Factor:	491647704846160786621308374952851056159804773134148316379963 428263935912252587969607610725248130736257827374761383487021 08473214785930571753 (140-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 198.90-digit and the GNFS difficulty is 139.69-digit. SNFS may be faster than GNFS. It will take about 18 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 88881_198.
Put the following polynomial file 88881_198.poly in there too.
And then, run "perl factMsieve.pl 88881_198".

88881_198.poly ^*1

n: 49164770484616078662130837495285105615980477313414831637996342826393591225258796960761072524813073625782737476138348702108473214785930571753
m: 2000000000000000000000000000000000000000
deg: 5
c5: 250
c0: -71
skew: 0.78
type: snfs
lss: 1
rlim: 14500000
alim: 14500000
lpbr: 28
lpba: 28
mfbr: 55
mfba: 55
rlambda: 2.5
alambda: 2.5

*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 140-digit composite number are not reported yet. Please report your efforts by ECM. (Anonymous reports are not acceptable)

Level	B1	Reported runs Total / Required runs (Required runs for lower level)
20	11e3	0 / 74
20	11e3	/ 74
25	5e4	0 / 214 (21)
25	5e4	/ 214 (21)
30	25e4	0 / 430 (50)
30	25e4	/ 430 (50)
35	1e6	0 / 904 (118)
35	1e6	/ 904 (118)
40	3e6	0 / 2350 (322)
40	3e6	/ 2350 (322)

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

echo 49164770484616078662130837495285105615980477313414831637996342826393591225258796960761072524813073625782737476138348702108473214785930571753 | ecm -n -c 74 11e3

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

echo 49164770484616078662130837495285105615980477313414831637996342826393591225258796960761072524813073625782737476138348702108473214785930571753 | ecm -n -c 214 5e4

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

echo 49164770484616078662130837495285105615980477313414831637996342826393591225258796960761072524813073625782737476138348702108473214785930571753 | ecm -n -c 430 25e4

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

echo 49164770484616078662130837495285105615980477313414831637996342826393591225258796960761072524813073625782737476138348702108473214785930571753 | ecm -n -c 904 1e6

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

echo 49164770484616078662130837495285105615980477313414831637996342826393591225258796960761072524813073625782737476138348702108473214785930571753 | ecm -n -c 2350 3e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers