Contribution and Reservation

(29·10¹⁹⁵-11)/9 =: 3(2)₁₉₄1_<196>; = 23 · 30269 · [4628386083368724526919092459672792255848245115496586724863035681824311890659007166497251776063359732689955747841057391508635211835645052582455895071614698668924042279189674932485413002860183_<190>] SUBMIT/RESERVE

Status

Expression:	(29·10¹⁹⁵-11)/9
Composite Factor:	462838608336872452691909245967279225584824511549658672486303 568182431189065900716649725177606335973268995574784105739150 863521183564505258245589507161469866892404227918967493248541 3002860183 (190-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 196.46-digit and the GNFS difficulty is 189.67-digit. SNFS must be faster than GNFS. It will take about 15 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 32221_195.
Put the following polynomial file 32221_195.poly in there too.
And then, run "perl factMsieve.pl 32221_195".

32221_195.poly ^*1

n: 4628386083368724526919092459672792255848245115496586724863035681824311890659007166497251776063359732689955747841057391508635211835645052582455895071614698668924042279189674932485413002860183
m: 1000000000000000000000000000000000000000
deg: 5
c5: 29
c0: -11
skew: 0.82
type: snfs
lss: 1
rlim: 13200000
alim: 13200000
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 190-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	825	Wataru Sakai	Aug 24, 2009
35	1e6	825 / 825
40	3e6	0 / 2111
40	3e6	/ 2111
45	11e6	0 / 4441 (612)
45	11e6	/ 4441 (612)
50	43e6	0 / 7548 (1266)
50	43e6	/ 7548 (1266)
55	11e7	0 / 17769 (3131)
55	11e7	/ 17769 (3131)

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

echo 4628386083368724526919092459672792255848245115496586724863035681824311890659007166497251776063359732689955747841057391508635211835645052582455895071614698668924042279189674932485413002860183 | ecm -n -c 2111 3e6

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

echo 4628386083368724526919092459672792255848245115496586724863035681824311890659007166497251776063359732689955747841057391508635211835645052582455895071614698668924042279189674932485413002860183 | ecm -n -c 4441 11e6

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

echo 4628386083368724526919092459672792255848245115496586724863035681824311890659007166497251776063359732689955747841057391508635211835645052582455895071614698668924042279189674932485413002860183 | ecm -n -c 7548 43e6

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

echo 4628386083368724526919092459672792255848245115496586724863035681824311890659007166497251776063359732689955747841057391508635211835645052582455895071614698668924042279189674932485413002860183 | ecm -n -c 17769 11e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers