Contribution and Reservation

(8·10²⁴²+1)/9 =: (8)₂₄₁9_<242>; = 6203908797041_<13> · [14327884531649643079543687483165236109140550637339442872657364071677202794628723742392100032583830517512514592446687734664738768526360494686573985850092011832815974326087990996866887251569205573473641034310077657719985935009606729_<230>] SUBMIT/RESERVE

Status

Expression:	(8·10²⁴²+1)/9
Composite Factor:	143278845316496430795436874831652361091405506373394428726573 640716772027946287237423921000325838305175125145924466877346 647387685263604946865739858500920118328159743260879909968668 87251569205573473641034310077657719985935009606729 (230-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 243.20-digit and the GNFS difficulty is 229.16-digit. SNFS must be faster than GNFS. It will take about 533 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 88889_242.
Put the following polynomial file 88889_242.poly in there too.
And then, run "perl factMsieve.pl 88889_242".

88889_242.poly ^*1

n: 14327884531649643079543687483165236109140550637339442872657364071677202794628723742392100032583830517512514592446687734664738768526360494686573985850092011832815974326087990996866887251569205573473641034310077657719985935009606729
m: 20000000000000000000000000000000000000000
deg: 6
c6: 25
c0: 2
skew: 0.66
type: snfs
lss: 1
rlim: 79000000
alim: 79000000
lpbr: 30
lpba: 30
mfbr: 61
mfba: 61
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 230-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 35-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
35	1e6	0 / 0
40	3e6	0 / 266
40	3e6	/ 266
45	11e6	600	Dmitry Domanov	May 12, 2009
		600 / 4479 (677)
		/ 3879 (77)
50	43e6	0 / 7419 (1106)
50	43e6	/ 7419 (1106)
55	11e7	0 / 17732 (3078)
55	11e7	/ 17732 (3078)

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

echo 14327884531649643079543687483165236109140550637339442872657364071677202794628723742392100032583830517512514592446687734664738768526360494686573985850092011832815974326087990996866887251569205573473641034310077657719985935009606729 | ecm -n -c 266 3e6

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

echo 14327884531649643079543687483165236109140550637339442872657364071677202794628723742392100032583830517512514592446687734664738768526360494686573985850092011832815974326087990996866887251569205573473641034310077657719985935009606729 | ecm -n -c 3879 11e6

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

echo 14327884531649643079543687483165236109140550637339442872657364071677202794628723742392100032583830517512514592446687734664738768526360494686573985850092011832815974326087990996866887251569205573473641034310077657719985935009606729 | ecm -n -c 7419 43e6

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

echo 14327884531649643079543687483165236109140550637339442872657364071677202794628723742392100032583830517512514592446687734664738768526360494686573985850092011832815974326087990996866887251569205573473641034310077657719985935009606729 | ecm -n -c 17732 11e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers