Contribution and Reservation

(8·10²³⁵+1)/9 =: (8)₂₃₄9_<235>; = 3² · 76543 · 1050702114689_<13> · [12280608372222213187496179705857115487173131098410772829046992031355640811916958681018009753801751556550452982365372923466140474264236900619003942702200010266891711374653542091878936361638833753245269714591617409078223_<218>] SUBMIT/RESERVE

Status

Expression:	(8·10²³⁵+1)/9
Composite Factor:	122806083722222131874961797058571154871731310984107728290469 920313556408119169586810180097538017515565504529823653729234 661404742642369006190039427022000102668917113746535420918789 36361638833753245269714591617409078223 (218-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 236.51-digit and the GNFS difficulty is 217.09-digit. SNFS must be faster than GNFS. It will take about 319 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 88889_235.
Put the following polynomial file 88889_235.poly in there too.
And then, run "perl factMsieve.pl 88889_235".

88889_235.poly ^*1

n: 12280608372222213187496179705857115487173131098410772829046992031355640811916958681018009753801751556550452982365372923466140474264236900619003942702200010266891711374653542091878936361638833753245269714591617409078223
m: 2000000000000000000000000000000000000000
deg: 6
c6: 5
c0: 4
skew: 0.96
type: snfs
lss: 1
rlim: 61000000
alim: 61000000
lpbr: 30
lpba: 30
mfbr: 60
mfba: 60
rlambda: 2.7
alambda: 2.7

*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 218-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	Oct 31, 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 12280608372222213187496179705857115487173131098410772829046992031355640811916958681018009753801751556550452982365372923466140474264236900619003942702200010266891711374653542091878936361638833753245269714591617409078223 | ecm -n -c 825 1e6

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

echo 12280608372222213187496179705857115487173131098410772829046992031355640811916958681018009753801751556550452982365372923466140474264236900619003942702200010266891711374653542091878936361638833753245269714591617409078223 | ecm -n -c 2336 3e6

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

echo 12280608372222213187496179705857115487173131098410772829046992031355640811916958681018009753801751556550452982365372923466140474264236900619003942702200010266891711374653542091878936361638833753245269714591617409078223 | ecm -n -c 4479 11e6

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

echo 12280608372222213187496179705857115487173131098410772829046992031355640811916958681018009753801751556550452982365372923466140474264236900619003942702200010266891711374653542091878936361638833753245269714591617409078223 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers