Contribution and Reservation

(64·10²¹¹+53)/9 =: 7(1)₂₁₀7_<212>; = 7 · 11 · 14370324706190106068284433819_<29> · [64265835491045736960072278010454722698450882502010690144263974659116792275108799238312632212437706878940811504701629222452158624703328639692104075334253854786574645906321896465667859_<182>] (Tetsuya Kobayashi / GMP-ECM 4c) SUBMIT/RESERVE

Status

Expression:	(64·10²¹¹+53)/9
Composite Factor:	642658354910457369600722780104547226984508825020106901442639 746591167922751087992383126322124377068789408115047016292224 521586247033286396921040753342538547865746459063218964656678 59 (182-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 212.81-digit and the GNFS difficulty is 181.81-digit. SNFS must be faster than GNFS. It will take about 52 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_211.
Put the following polynomial file 71117_211.poly in there too.
And then, run "perl factMsieve.pl 71117_211".

71117_211.poly ^*1

n: 64265835491045736960072278010454722698450882502010690144263974659116792275108799238312632212437706878940811504701629222452158624703328639692104075334253854786574645906321896465667859
m: 200000000000000000000000000000000000
deg: 6
c6: 10
c0: 53
skew: 1.32
type: snfs
lss: 1
rlim: 25000000
alim: 25000000
lpbr: 29
lpba: 29
mfbr: 57
mfba: 57
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 182-digit composite number are not reported yet. Please report your efforts by ECM. (Anonymous reports are not acceptable)

Level	B1	Reported runs Total / Required runs (Required runs for lower level)
20	11e3	0 / 74
20	11e3	/ 74
25	5e4	0 / 214 (21)
25	5e4	/ 214 (21)
30	25e4	0 / 430 (50)
30	25e4	/ 430 (50)
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 20-digit

echo 64265835491045736960072278010454722698450882502010690144263974659116792275108799238312632212437706878940811504701629222452158624703328639692104075334253854786574645906321896465667859 | ecm -n -c 74 11e3

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

echo 64265835491045736960072278010454722698450882502010690144263974659116792275108799238312632212437706878940811504701629222452158624703328639692104075334253854786574645906321896465667859 | ecm -n -c 214 5e4

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

echo 64265835491045736960072278010454722698450882502010690144263974659116792275108799238312632212437706878940811504701629222452158624703328639692104075334253854786574645906321896465667859 | ecm -n -c 430 25e4

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

echo 64265835491045736960072278010454722698450882502010690144263974659116792275108799238312632212437706878940811504701629222452158624703328639692104075334253854786574645906321896465667859 | ecm -n -c 904 1e6

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

echo 64265835491045736960072278010454722698450882502010690144263974659116792275108799238312632212437706878940811504701629222452158624703328639692104075334253854786574645906321896465667859 | ecm -n -c 2350 3e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers