Contribution and Reservation

(29·10¹⁹⁶+61)/9 =: 3(2)₁₉₅9_<197>; = 3 · 252293 · [42572488102090588089010558123851001576503274925347674096153047213916917000236791114857490064095082862944040226009999249843399304541706431572579265935799807131948729218570236751478403050186651_<191>] SUBMIT/RESERVE

Status

Expression:	(29·10¹⁹⁶+61)/9
Composite Factor:	425724881020905880890105581238510015765032749253476740961530 472139169170002367911148574900640950828629440402260099992498 433993045417064315725792659357998071319487292185702367514784 03050186651 (191-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 197.46-digit and the GNFS difficulty is 190.63-digit. SNFS must be faster than GNFS. It will take about 16 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 32229_196.
Put the following polynomial file 32229_196.poly in there too.
And then, run "perl factMsieve.pl 32229_196".

32229_196.poly ^*1

n: 42572488102090588089010558123851001576503274925347674096153047213916917000236791114857490064095082862944040226009999249843399304541706431572579265935799807131948729218570236751478403050186651
m: 1000000000000000000000000000000000000000
deg: 5
c5: 290
c0: 61
skew: 0.73
type: snfs
lss: 1
rlim: 13700000
alim: 13700000
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 191-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	2111	Wataru Sakai	Sep 10, 2009
40	3e6	2111 / 2111
45	11e6	0 / 3974
45	11e6	/ 3974
50	43e6	0 / 7469 (1133)
50	43e6	/ 7469 (1133)
55	11e7	0 / 17752 (3098)
55	11e7	/ 17752 (3098)
60	26e7	0 / 42014 (7636)
60	26e7	/ 42014 (7636)

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

echo 42572488102090588089010558123851001576503274925347674096153047213916917000236791114857490064095082862944040226009999249843399304541706431572579265935799807131948729218570236751478403050186651 | ecm -n -c 3974 11e6

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

echo 42572488102090588089010558123851001576503274925347674096153047213916917000236791114857490064095082862944040226009999249843399304541706431572579265935799807131948729218570236751478403050186651 | ecm -n -c 7469 43e6

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

echo 42572488102090588089010558123851001576503274925347674096153047213916917000236791114857490064095082862944040226009999249843399304541706431572579265935799807131948729218570236751478403050186651 | ecm -n -c 17752 11e7

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

echo 42572488102090588089010558123851001576503274925347674096153047213916917000236791114857490064095082862944040226009999249843399304541706431572579265935799807131948729218570236751478403050186651 | ecm -n -c 42014 26e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers