Contribution and Reservation

(29·10¹⁹⁸+43)/9 =: 3(2)₁₉₇7_<199>; = 1016929 · [3168581309238129920793115568758706086877473473784524015169419125840862264939068727730473044059341627805109523105568060525584600520018823558205363621474284067247784478780939694140124061977013363_<193>] SUBMIT/RESERVE

Status

Expression:	(29·10¹⁹⁸+43)/9
Composite Factor:	316858130923812992079311556875870608687747347378452401516941 912584086226493906872773047304405934162780510952310556806052 558460052001882355820536362147428406724778447878093969414012 4061977013363 (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 200.86-digit and the GNFS difficulty is 192.50-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 32227_198.
Put the following polynomial file 32227_198.poly in there too.
And then, run "perl factMsieve.pl 32227_198".

32227_198.poly ^*1

n: 3168581309238129920793115568758706086877473473784524015169419125840862264939068727730473044059341627805109523105568060525584600520018823558205363621474284067247784478780939694140124061977013363
m: 5000000000000000000000000000000000000000
deg: 5
c5: 232
c0: 1075
skew: 1.36
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 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	Nov 13, 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 3168581309238129920793115568758706086877473473784524015169419125840862264939068727730473044059341627805109523105568060525584600520018823558205363621474284067247784478780939694140124061977013363 | ecm -n -c 825 1e6

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

echo 3168581309238129920793115568758706086877473473784524015169419125840862264939068727730473044059341627805109523105568060525584600520018823558205363621474284067247784478780939694140124061977013363 | ecm -n -c 2336 3e6

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

echo 3168581309238129920793115568758706086877473473784524015169419125840862264939068727730473044059341627805109523105568060525584600520018823558205363621474284067247784478780939694140124061977013363 | ecm -n -c 4479 11e6

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

echo 3168581309238129920793115568758706086877473473784524015169419125840862264939068727730473044059341627805109523105568060525584600520018823558205363621474284067247784478780939694140124061977013363 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers