Contribution and Reservation

(31·10¹⁹⁸+41)/9 =: 3(4)₁₉₇9_<199>; = 59 · 1298712497_<10> · [44952531408972576051380618066997759577770198936720995108670181712612920032789074711027993901997129361630628527674043459831389553631918644815525997005737865411491095366494728554521959229763_<188>] SUBMIT/RESERVE

Status

Expression:	(31·10¹⁹⁸+41)/9
Composite Factor:	449525314089725760513806180669977595777701989367209951086701 817126129200327890747110279939019971293616306285276740434598 313895536319186448155259970057378654114910953664947285545219 59229763 (188-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 200.89-digit and the GNFS difficulty is 187.65-digit. SNFS must be faster than GNFS. It will take about 21 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 34449_198.
Put the following polynomial file 34449_198.poly in there too.
And then, run "perl factMsieve.pl 34449_198".

34449_198.poly ^*1

n: 44952531408972576051380618066997759577770198936720995108670181712612920032789074711027993901997129361630628527674043459831389553631918644815525997005737865411491095366494728554521959229763
m: 5000000000000000000000000000000000000000
deg: 5
c5: 248
c0: 1025
skew: 1.33
type: snfs
lss: 1
rlim: 15600000
alim: 15600000
lpbr: 29
lpba: 29
mfbr: 56
mfba: 56
rlambda: 2.6
alambda: 2.6

*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 188-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	Nov 21, 2008
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 44952531408972576051380618066997759577770198936720995108670181712612920032789074711027993901997129361630628527674043459831389553631918644815525997005737865411491095366494728554521959229763 | ecm -n -c 825 1e6

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

echo 44952531408972576051380618066997759577770198936720995108670181712612920032789074711027993901997129361630628527674043459831389553631918644815525997005737865411491095366494728554521959229763 | ecm -n -c 2336 3e6

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

echo 44952531408972576051380618066997759577770198936720995108670181712612920032789074711027993901997129361630628527674043459831389553631918644815525997005737865411491095366494728554521959229763 | ecm -n -c 4479 11e6

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

echo 44952531408972576051380618066997759577770198936720995108670181712612920032789074711027993901997129361630628527674043459831389553631918644815525997005737865411491095366494728554521959229763 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers