Contribution and Reservation

(64·10²³⁵+53)/9 =: 7(1)₂₃₄7_<236>; = 7 · 11 · 193 · 28107359195838759279509711482249_<32> · [170243048162211606139168092899412373887432262726392638811930752489088113456154186085588507167609348929816413787030872916649323684810730559987175370389656582406055523330513546443606392638754557740210553_<201>] (suberi / GMP-ECM 6.1.2 B1=11000000, sigma=984891023 for P32 / May 17, 2007) SUBMIT/RESERVE

Status

Expression:	(64·10²³⁵+53)/9
Composite Factor:	170243048162211606139168092899412373887432262726392638811930 752489088113456154186085588507167609348929816413787030872916 649323684810730559987175370389656582406055523330513546443606 392638754557740210553 (201-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 236.81-digit and the GNFS difficulty is 200.23-digit. SNFS must be faster than GNFS. It will take about 326 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_235.
Put the following polynomial file 71117_235.poly in there too.
And then, run "perl factMsieve.pl 71117_235".

71117_235.poly ^*1

n: 170243048162211606139168092899412373887432262726392638811930752489088113456154186085588507167609348929816413787030872916649323684810730559987175370389656582406055523330513546443606392638754557740210553
m: 2000000000000000000000000000000000000000
deg: 6
c6: 10
c0: 53
skew: 1.32
type: snfs
lss: 1
rlim: 62000000
alim: 62000000
lpbr: 30
lpba: 30
mfbr: 60
mfba: 60
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 201-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 20-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
20	11e3	74	Max Dettweiler	Mar 6, 2009
20	11e3	74 / 74
25	5e4	0 / 204
25	5e4	/ 204
30	25e4	0 / 430 (48)
30	25e4	/ 430 (48)
35	1e6	0 / 904 (118)
35	1e6	/ 904 (118)
40	3e6	0 / 2350 (322)
40	3e6	/ 2350 (322)

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

echo 170243048162211606139168092899412373887432262726392638811930752489088113456154186085588507167609348929816413787030872916649323684810730559987175370389656582406055523330513546443606392638754557740210553 | ecm -n -c 204 5e4

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

echo 170243048162211606139168092899412373887432262726392638811930752489088113456154186085588507167609348929816413787030872916649323684810730559987175370389656582406055523330513546443606392638754557740210553 | ecm -n -c 430 25e4

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

echo 170243048162211606139168092899412373887432262726392638811930752489088113456154186085588507167609348929816413787030872916649323684810730559987175370389656582406055523330513546443606392638754557740210553 | ecm -n -c 904 1e6

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

echo 170243048162211606139168092899412373887432262726392638811930752489088113456154186085588507167609348929816413787030872916649323684810730559987175370389656582406055523330513546443606392638754557740210553 | ecm -n -c 2350 3e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers