Contribution and Reservation

(29·10¹⁹⁷-11)/9 =: 3(2)₁₉₆1_<198>; = 3² · 733 · [48843750526333518602731881494955619557711417647752345342158893773263941522240749162077038384450844660030653664123423104778266215283041112963805096592727333973354891954255301231199366715510417193_<194>] SUBMIT/RESERVE

Status

Expression:	(29·10¹⁹⁷-11)/9
Composite Factor:	488437505263335186027318814949556195577114176477523453421588 937732639415222407491620770383844508446600306536641234231047 782662152830411129638050965927273339733548919542553012311993 66715510417193 (194-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 199.37-digit and the GNFS difficulty is 193.69-digit. SNFS must be faster than GNFS. It will take about 18 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 32221_197.
Put the following polynomial file 32221_197.poly in there too.
And then, run "perl factMsieve.pl 32221_197".

32221_197.poly ^*1

n: 48843750526333518602731881494955619557711417647752345342158893773263941522240749162077038384450844660030653664123423104778266215283041112963805096592727333973354891954255301231199366715510417193
m: 2000000000000000000000000000000000000000
deg: 5
c5: 725
c0: -88
skew: 0.66
type: snfs
lss: 1
rlim: 14700000
alim: 14700000
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 194-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	2336	Wataru Sakai	Sep 3, 2009
40	3e6	2336 / 2336
45	11e6	0 / 3962
45	11e6	/ 3962
50	43e6	0 / 7465 (1130)
50	43e6	/ 7465 (1130)
55	11e7	0 / 17751 (3097)
55	11e7	/ 17751 (3097)
60	26e7	0 / 42014 (7636)
60	26e7	/ 42014 (7636)

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

echo 48843750526333518602731881494955619557711417647752345342158893773263941522240749162077038384450844660030653664123423104778266215283041112963805096592727333973354891954255301231199366715510417193 | ecm -n -c 3962 11e6

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

echo 48843750526333518602731881494955619557711417647752345342158893773263941522240749162077038384450844660030653664123423104778266215283041112963805096592727333973354891954255301231199366715510417193 | ecm -n -c 7465 43e6

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

echo 48843750526333518602731881494955619557711417647752345342158893773263941522240749162077038384450844660030653664123423104778266215283041112963805096592727333973354891954255301231199366715510417193 | ecm -n -c 17751 11e7

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

echo 48843750526333518602731881494955619557711417647752345342158893773263941522240749162077038384450844660030653664123423104778266215283041112963805096592727333973354891954255301231199366715510417193 | ecm -n -c 42014 26e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers