Contribution and Reservation

(10²⁰²+53)/9 =: (1)₂₀₁7_<202>; = 8839 · [125705522243592161003632889592839813453004990509233070608791844225716835740594084298123216552903169036215760958378901585146635491697150255810737765710047642392930321429020376865155686289298688891403_<198>] SUBMIT/RESERVE

Status

Expression:	(10²⁰²+53)/9
Composite Factor:	125705522243592161003632889592839813453004990509233070608791 844225716835740594084298123216552903169036215760958378901585 146635491697150255810737765710047642392930321429020376865155 686289298688891403 (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 202.00-digit and the GNFS difficulty is 197.10-digit. SNFS must be faster than GNFS. It will take about 23 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 11117_202.
Put the following polynomial file 11117_202.poly in there too.
And then, run "perl factMsieve.pl 11117_202".

11117_202.poly ^*1

n: 125705522243592161003632889592839813453004990509233070608791844225716835740594084298123216552903169036215760958378901585146635491697150255810737765710047642392930321429020376865155686289298688891403
m: 10000000000000000000000000000000000000000
deg: 5
c5: 100
c0: 53
skew: 0.88
type: snfs
lss: 1
rlim: 16300000
alim: 16300000
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	825	Luigi Morelli	Feb 11, 2009
35	1e6	825 / 233
40	3e6	11	Luigi Morelli	Feb 11, 2009
		100	Luigi Morelli	Feb 26, 2009
		100	Luigi Morelli	Feb 26, 2009
		211 / 2111
		/ 1900
45	11e6	0 / 4394 (551)
45	11e6	/ 4394 (551)
50	43e6	0 / 7540 (1253)
50	43e6	/ 7540 (1253)
55	11e7	0 / 17767 (3128)
55	11e7	/ 17767 (3128)

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

echo 125705522243592161003632889592839813453004990509233070608791844225716835740594084298123216552903169036215760958378901585146635491697150255810737765710047642392930321429020376865155686289298688891403 | ecm -n -c 1900 3e6

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

echo 125705522243592161003632889592839813453004990509233070608791844225716835740594084298123216552903169036215760958378901585146635491697150255810737765710047642392930321429020376865155686289298688891403 | ecm -n -c 4394 11e6

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

echo 125705522243592161003632889592839813453004990509233070608791844225716835740594084298123216552903169036215760958378901585146635491697150255810737765710047642392930321429020376865155686289298688891403 | ecm -n -c 7540 43e6

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

echo 125705522243592161003632889592839813453004990509233070608791844225716835740594084298123216552903169036215760958378901585146635491697150255810737765710047642392930321429020376865155686289298688891403 | ecm -n -c 17767 11e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers