Contribution and Reservation

(85·10¹⁹⁹+41)/9 =: 9(4)₁₉₈9_<200>; = 3⁴ · 11 · 39563123 · [2679218578027884566909510621566622508412370353960459174047801723835998181533243266063199114190769934128418445951926515332699120266854698440095481379308951468716210952261128283586069543668193_<190>] SUBMIT/RESERVE

Status

Expression:	(85·10¹⁹⁹+41)/9
Composite Factor:	267921857802788456690951062156662250841237035396045917404780 172383599818153324326606319911419076993412841844595192651533 269912026685469844009548137930895146871621095226112828358606 9543668193 (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 201.23-digit and the GNFS difficulty is 189.43-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 94449_199.
Put the following polynomial file 94449_199.poly in there too.
And then, run "perl factMsieve.pl 94449_199".

94449_199.poly ^*1

n: 2679218578027884566909510621566622508412370353960459174047801723835998181533243266063199114190769934128418445951926515332699120266854698440095481379308951468716210952261128283586069543668193
m: 10000000000000000000000000000000000000000
deg: 5
c5: 17
c0: 82
skew: 1.37
type: snfs
lss: 1
rlim: 15800000
alim: 15800000
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 190-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 20-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
20	11e3	74	Max Dettweiler	Mar 6, 2009
20	11e3	74 / 74
25	5e4	0 / 204
25	5e4	/ 204
30	25e4	0 / 430 (48)
30	25e4	/ 430 (48)
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 25-digit

echo 2679218578027884566909510621566622508412370353960459174047801723835998181533243266063199114190769934128418445951926515332699120266854698440095481379308951468716210952261128283586069543668193 | ecm -n -c 204 5e4

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

echo 2679218578027884566909510621566622508412370353960459174047801723835998181533243266063199114190769934128418445951926515332699120266854698440095481379308951468716210952261128283586069543668193 | ecm -n -c 430 25e4

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

echo 2679218578027884566909510621566622508412370353960459174047801723835998181533243266063199114190769934128418445951926515332699120266854698440095481379308951468716210952261128283586069543668193 | ecm -n -c 904 1e6

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

echo 2679218578027884566909510621566622508412370353960459174047801723835998181533243266063199114190769934128418445951926515332699120266854698440095481379308951468716210952261128283586069543668193 | ecm -n -c 2350 3e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers