Contribution and Reservation

(7·10²³⁰-43)/9 =: (7)₂₂₉3_<230>; = 23 · 107 · 10028839 · 2502438724908833_<16> · [1259301745869358141721908030597225999452405830243357982295977657738670462995091830392064381617035595236469094482974921201570696442853147198953372291122609180817270229940616074719050475424625205401643411239_<205>] SUBMIT/RESERVE

Status

Expression:	(7·10²³⁰-43)/9
Composite Factor:	125930174586935814172190803059722599945240583024335798229597 765773867046299509183039206438161703559523646909448297492120 157069644285314719895337229112260918081727022994061607471905 0475424625205401643411239 (205-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 230.85-digit and the GNFS difficulty is 204.10-digit. SNFS must be faster than GNFS. It will take about 206 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_230.
Put the following polynomial file 77773_230.poly in there too.
And then, run "perl factMsieve.pl 77773_230".

77773_230.poly ^*1

n: 1259301745869358141721908030597225999452405830243357982295977657738670462995091830392064381617035595236469094482974921201570696442853147198953372291122609180817270229940616074719050475424625205401643411239
m: 100000000000000000000000000000000000000
deg: 6
c6: 700
c0: -43
skew: 0.63
type: snfs
lss: 1
rlim: 49000000
alim: 49000000
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 205-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 1259301745869358141721908030597225999452405830243357982295977657738670462995091830392064381617035595236469094482974921201570696442853147198953372291122609180817270229940616074719050475424625205401643411239 | ecm -n -c 786 1e6

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

echo 1259301745869358141721908030597225999452405830243357982295977657738670462995091830392064381617035595236469094482974921201570696442853147198953372291122609180817270229940616074719050475424625205401643411239 | ecm -n -c 2318 3e6

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

echo 1259301745869358141721908030597225999452405830243357982295977657738670462995091830392064381617035595236469094482974921201570696442853147198953372291122609180817270229940616074719050475424625205401643411239 | ecm -n -c 4475 11e6

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

echo 1259301745869358141721908030597225999452405830243357982295977657738670462995091830392064381617035595236469094482974921201570696442853147198953372291122609180817270229940616074719050475424625205401643411239 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers