Contribution and Reservation

(7·10²²⁷-43)/9 =: (7)₂₂₆3_<227>; = 3559 · 8458505971912909206817868981_<28> · [2583651199824609680034453819884625327726724648528050962698862538834572380539968219106118313227233933547355672372029262918293850733930449356683602772128068063946794992912419603436233160706908852287_<196>] (Serge Batalov / GMP-ECM 6.2.3 B1=3000000, sigma=3642532168 for P28 / Jun 1, 2009) SUBMIT/RESERVE

Status

Expression:	(7·10²²⁷-43)/9
Composite Factor:	258365119982460968003445381988462532772672464852805096269886 253883457238053996821910611831322723393354735567237202926291 829385073393044935668360277212806806394679499291241960343623 3160706908852287 (196-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 228.54-digit and the GNFS difficulty is 195.41-digit. SNFS must be faster than GNFS. It will take about 173 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 77773_227.
Put the following polynomial file 77773_227.poly in there too.
And then, run "perl factMsieve.pl 77773_227".

77773_227.poly ^*1

n: 2583651199824609680034453819884625327726724648528050962698862538834572380539968219106118313227233933547355672372029262918293850733930449356683602772128068063946794992912419603436233160706908852287
m: 50000000000000000000000000000000000000
deg: 6
c6: 224
c0: -215
skew: 0.99
type: snfs
lss: 1
rlim: 45000000
alim: 45000000
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 196-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 30-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
30	25e4	0 / 0
35	1e6	118	Makoto Kamada	May 31, 2009
		118 / 904
		/ 786
40	3e6	0 / 2318 (280)
40	3e6	/ 2318 (280)
45	11e6	0 / 4475 (672)
45	11e6	/ 4475 (672)
50	43e6	0 / 7553 (1276)
50	43e6	/ 7553 (1276)

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

echo 2583651199824609680034453819884625327726724648528050962698862538834572380539968219106118313227233933547355672372029262918293850733930449356683602772128068063946794992912419603436233160706908852287 | ecm -n -c 786 1e6

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

echo 2583651199824609680034453819884625327726724648528050962698862538834572380539968219106118313227233933547355672372029262918293850733930449356683602772128068063946794992912419603436233160706908852287 | ecm -n -c 2318 3e6

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

echo 2583651199824609680034453819884625327726724648528050962698862538834572380539968219106118313227233933547355672372029262918293850733930449356683602772128068063946794992912419603436233160706908852287 | ecm -n -c 4475 11e6

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

echo 2583651199824609680034453819884625327726724648528050962698862538834572380539968219106118313227233933547355672372029262918293850733930449356683602772128068063946794992912419603436233160706908852287 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers