Contribution and Reservation

(64·10²³⁰+53)/9 =: 7(1)₂₂₉7_<231>; = 3⁴ · 17 · 3232206055590841780396196269472673101807_<40> · [159773402781755490907447637584752460118703047764753337154560922740787663830010334120610537832830875279251407218065664853653746287567720114801810544062706842945696047019376975588206911877603_<189>] (Serge Batalov / GMP-ECM 6.2.1 B1=11000000, sigma=951095515 for P40 / Dec 31, 2008) SUBMIT/RESERVE

Status

Expression:	(64·10²³⁰+53)/9
Composite Factor:	159773402781755490907447637584752460118703047764753337154560 922740787663830010334120610537832830875279251407218065664853 653746287567720114801810544062706842945696047019376975588206 911877603 (189-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 231.81-digit and the GNFS difficulty is 188.20-digit. SNFS must be faster than GNFS. It will take about 222 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 71117_230.
Put the following polynomial file 71117_230.poly in there too.
And then, run "perl factMsieve.pl 71117_230".

71117_230.poly ^*1

n: 159773402781755490907447637584752460118703047764753337154560922740787663830010334120610537832830875279251407218065664853653746287567720114801810544062706842945696047019376975588206911877603
m: 200000000000000000000000000000000000000
deg: 6
c6: 100
c0: 53
skew: 0.90
type: snfs
lss: 1
rlim: 51000000
alim: 51000000
lpbr: 30
lpba: 30
mfbr: 59
mfba: 59
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 189-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	904	Serge Batalov	Aug 8, 2008
35	1e6	904 / 904
40	3e6	0 / 2104
40	3e6	/ 2104
45	11e6	0 / 4439 (610)
45	11e6	/ 4439 (610)
50	43e6	0 / 7548 (1266)
50	43e6	/ 7548 (1266)
55	11e7	0 / 17769 (3131)
55	11e7	/ 17769 (3131)

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

echo 159773402781755490907447637584752460118703047764753337154560922740787663830010334120610537832830875279251407218065664853653746287567720114801810544062706842945696047019376975588206911877603 | ecm -n -c 2104 3e6

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

echo 159773402781755490907447637584752460118703047764753337154560922740787663830010334120610537832830875279251407218065664853653746287567720114801810544062706842945696047019376975588206911877603 | ecm -n -c 4439 11e6

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

echo 159773402781755490907447637584752460118703047764753337154560922740787663830010334120610537832830875279251407218065664853653746287567720114801810544062706842945696047019376975588206911877603 | ecm -n -c 7548 43e6

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

echo 159773402781755490907447637584752460118703047764753337154560922740787663830010334120610537832830875279251407218065664853653746287567720114801810544062706842945696047019376975588206911877603 | ecm -n -c 17769 11e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers