Contribution and Reservation

(10¹⁹³+11)/3 =: (3)₁₉₂7_<193>; = 7 · 157 · 167 · [18162038071264204984026487516323131716548704229393805655295414630248147926167682832696753898935522948643204945886207566668301250093080445115229050543135748521156050047312109175643253983389_<188>] SUBMIT/RESERVE

Status

Expression:	(10¹⁹³+11)/3
Composite Factor:	181620380712642049840264875163231317165487042293938056552954 146302481479261676828326967538989355229486432049458862075666 683012500930804451152290505431357485211560500473121091756432 53983389 (188-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 193.60-digit and the GNFS difficulty is 187.26-digit. SNFS must be faster than GNFS. It will take about 12 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 33337_193.
Put the following polynomial file 33337_193.poly in there too.
And then, run "perl factMsieve.pl 33337_193".

33337_193.poly ^*1

n: 18162038071264204984026487516323131716548704229393805655295414630248147926167682832696753898935522948643204945886207566668301250093080445115229050543135748521156050047312109175643253983389
m: 200000000000000000000000000000000000000
deg: 5
c5: 125
c0: 44
skew: 0.81
type: snfs
lss: 1
rlim: 11800000
alim: 11800000
lpbr: 28
lpba: 28
mfbr: 55
mfba: 55
rlambda: 2.5
alambda: 2.5

*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 188-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 40-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
40	3e6	2506	Max Dettweiler	Apr 8, 2009
40	3e6	2506 / 2004
45	11e6	0 / 3869
45	11e6	/ 3869
50	43e6	0 / 7451 (1103)
50	43e6	/ 7451 (1103)
55	11e7	0 / 17749 (3091)
55	11e7	/ 17749 (3091)
60	26e7	0 / 42014 (7634)
60	26e7	/ 42014 (7634)

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

echo 18162038071264204984026487516323131716548704229393805655295414630248147926167682832696753898935522948643204945886207566668301250093080445115229050543135748521156050047312109175643253983389 | ecm -n -c 3869 11e6

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

echo 18162038071264204984026487516323131716548704229393805655295414630248147926167682832696753898935522948643204945886207566668301250093080445115229050543135748521156050047312109175643253983389 | ecm -n -c 7451 43e6

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

echo 18162038071264204984026487516323131716548704229393805655295414630248147926167682832696753898935522948643204945886207566668301250093080445115229050543135748521156050047312109175643253983389 | ecm -n -c 17749 11e7

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

echo 18162038071264204984026487516323131716548704229393805655295414630248147926167682832696753898935522948643204945886207566668301250093080445115229050543135748521156050047312109175643253983389 | ecm -n -c 42014 26e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers