Contribution and Reservation

(32·10²⁰⁴+13)/9 =: 3(5)₂₀₃7_<205>; = 12659327 · [280864500581709877275115458788255928261870125920244856267284631762459059281394307576979057066426639864469537405547352995586223150374072457055225412500645220362469154604787091411380364497698460238491_<198>] SUBMIT/RESERVE

Status

Expression:	(32·10²⁰⁴+13)/9
Composite Factor:	280864500581709877275115458788255928261870125920244856267284 631762459059281394307576979057066426639864469537405547352995 586223150374072457055225412500645220362469154604787091411380 364497698460238491 (198-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 206.20-digit and the GNFS difficulty is 197.45-digit. SNFS must be faster than GNFS. It will take about 31 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 35557_204.
Put the following polynomial file 35557_204.poly in there too.
And then, run "perl factMsieve.pl 35557_204".

35557_204.poly ^*1

n: 280864500581709877275115458788255928261870125920244856267284631762459059281394307576979057066426639864469537405547352995586223150374072457055225412500645220362469154604787091411380364497698460238491
m: 100000000000000000000000000000000000000000
deg: 5
c5: 16
c0: 65
skew: 1.32
type: snfs
lss: 1
rlim: 19100000
alim: 19100000
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 198-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	0 / 0
40	3e6	300	Serge Batalov	Nov 27, 2008
		300 / 2336
		/ 2036
45	11e6	0 / 4413 (590)
45	11e6	/ 4413 (590)
50	43e6	0 / 7542 (1258)
50	43e6	/ 7542 (1258)
55	11e7	0 / 17767 (3129)
55	11e7	/ 17767 (3129)

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

echo 280864500581709877275115458788255928261870125920244856267284631762459059281394307576979057066426639864469537405547352995586223150374072457055225412500645220362469154604787091411380364497698460238491 | ecm -n -c 2036 3e6

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

echo 280864500581709877275115458788255928261870125920244856267284631762459059281394307576979057066426639864469537405547352995586223150374072457055225412500645220362469154604787091411380364497698460238491 | ecm -n -c 4413 11e6

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

echo 280864500581709877275115458788255928261870125920244856267284631762459059281394307576979057066426639864469537405547352995586223150374072457055225412500645220362469154604787091411380364497698460238491 | ecm -n -c 7542 43e6

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

echo 280864500581709877275115458788255928261870125920244856267284631762459059281394307576979057066426639864469537405547352995586223150374072457055225412500645220362469154604787091411380364497698460238491 | ecm -n -c 17767 11e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers