Contribution and Reservation

4·10²¹¹-9 =: 3(9)₂₁₀1_<212>; = 31 · 67 · 1907 · 3169 · 395448671 · [8058615637588173282347575467486607487799336802402892318644677892935480193398494054573528576268437708581307652915930605834372668524365878972744353022629470411564500027782037497755941023184376431_<193>] SUBMIT/RESERVE

Status

Expression:	4·10²¹¹-9
Composite Factor:	805861563758817328234757546748660748779933680240289231864467 789293548019339849405457352857626843770858130765291593060583 437266852436587897274435302262947041156450002778203749775594 1023184376431 (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 211.60-digit and the GNFS difficulty is 192.91-digit. SNFS must be faster than GNFS. It will take about 47 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 39991_211.
Put the following polynomial file 39991_211.poly in there too.
And then, run "perl factMsieve.pl 39991_211".

39991_211.poly ^*1

n: 8058615637588173282347575467486607487799336802402892318644677892935480193398494054573528576268437708581307652915930605834372668524365878972744353022629470411564500027782037497755941023184376431
m: 100000000000000000000000000000000000
deg: 6
c6: 40
c0: -9
skew: 0.78
type: snfs
lss: 1
rlim: 24000000
alim: 24000000
lpbr: 29
lpba: 29
mfbr: 57
mfba: 57
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 3, 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 8058615637588173282347575467486607487799336802402892318644677892935480193398494054573528576268437708581307652915930605834372668524365878972744353022629470411564500027782037497755941023184376431 | ecm -n -c 825 1e6

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

echo 8058615637588173282347575467486607487799336802402892318644677892935480193398494054573528576268437708581307652915930605834372668524365878972744353022629470411564500027782037497755941023184376431 | ecm -n -c 2336 3e6

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

echo 8058615637588173282347575467486607487799336802402892318644677892935480193398494054573528576268437708581307652915930605834372668524365878972744353022629470411564500027782037497755941023184376431 | ecm -n -c 4479 11e6

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

echo 8058615637588173282347575467486607487799336802402892318644677892935480193398494054573528576268437708581307652915930605834372668524365878972744353022629470411564500027782037497755941023184376431 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers