Contribution and Reservation

(16·10²²⁰-7)/9 =: 1(7)₂₂₀_<221>; = 1100821369_<10> · 1458332621_<10> · 15723151383501713_<17> · [704310941802372718202088027554645390633956239357289629672137188709341432039088596361783465148742247067036382583126674698370207051891346658858324040517341935530041478194319265216223417421_<186>] SUBMIT/RESERVE

Status

Expression:	(16·10²²⁰-7)/9
Composite Factor:	704310941802372718202088027554645390633956239357289629672137 188709341432039088596361783465148742247067036382583126674698 370207051891346658858324040517341935530041478194319265216223 417421 (186-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 222.60-digit and the GNFS difficulty is 185.85-digit. SNFS must be faster than GNFS. It will take about 110 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 17777_220.
Put the following polynomial file 17777_220.poly in there too.
And then, run "perl factMsieve.pl 17777_220".

17777_220.poly ^*1

n: 704310941802372718202088027554645390633956239357289629672137188709341432039088596361783465148742247067036382583126674698370207051891346658858324040517341935530041478194319265216223417421
m: 10000000000000000000000000000000000000
deg: 6
c6: 4
c0: -175
skew: 1.88
type: snfs
lss: 1
rlim: 36000000
alim: 36000000
lpbr: 29
lpba: 29
mfbr: 58
mfba: 58
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 186-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 45-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
45	11e6	4500	Dmitry Domanov	Sep 2, 2009
45	11e6	4500 / 3870
50	43e6	0 / 6441
50	43e6	/ 6441
55	11e7	0 / 17467 (2672)
55	11e7	/ 17467 (2672)
60	26e7	0 / 41942 (7513)
60	26e7	/ 41942 (7513)
65	85e7	0 / 69396 (13587)
65	85e7	/ 69396 (13587)

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

echo 704310941802372718202088027554645390633956239357289629672137188709341432039088596361783465148742247067036382583126674698370207051891346658858324040517341935530041478194319265216223417421 | ecm -n -c 6441 43e6

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

echo 704310941802372718202088027554645390633956239357289629672137188709341432039088596361783465148742247067036382583126674698370207051891346658858324040517341935530041478194319265216223417421 | ecm -n -c 17467 11e7

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

echo 704310941802372718202088027554645390633956239357289629672137188709341432039088596361783465148742247067036382583126674698370207051891346658858324040517341935530041478194319265216223417421 | ecm -n -c 41942 26e7

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

echo 704310941802372718202088027554645390633956239357289629672137188709341432039088596361783465148742247067036382583126674698370207051891346658858324040517341935530041478194319265216223417421 | ecm -n -c 69396 85e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers