Contribution and Reservation

(8·10²⁰⁵+1)/9 =: (8)₂₀₄9_<205>; = 3 · 29² · 383 · 9283 · [990930287301268043844290701781305127266910740305203221011224117696628194867352108647019972882679138379406098037262642098387030958781515056950685458562952332773169892919541643992123964538929784087_<195>] SUBMIT/RESERVE

Status

Expression:	(8·10²⁰⁵+1)/9
Composite Factor:	990930287301268043844290701781305127266910740305203221011224 117696628194867352108647019972882679138379406098037262642098 387030958781515056950685458562952332773169892919541643992123 964538929784087 (195-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 206.51-digit and the GNFS difficulty is 195.00-digit. SNFS must be faster than GNFS. It will take about 32 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_205.
Put the following polynomial file 88889_205.poly in there too.
And then, run "perl factMsieve.pl 88889_205".

88889_205.poly ^*1

n: 990930287301268043844290701781305127266910740305203221011224117696628194867352108647019972882679138379406098037262642098387030958781515056950685458562952332773169892919541643992123964538929784087
m: 200000000000000000000000000000000000000000
deg: 5
c5: 1
c0: 4
skew: 1.32
type: snfs
lss: 1
rlim: 19400000
alim: 19400000
lpbr: 29
lpba: 29
mfbr: 56
mfba: 56
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 195-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	430	Makoto Kamada	Oct 31, 2008
30	25e4	430 / 430
35	1e6	0 / 825
35	1e6	/ 825
40	3e6	0 / 2336 (294)
40	3e6	/ 2336 (294)
45	11e6	0 / 4479 (677)
45	11e6	/ 4479 (677)
50	43e6	0 / 7553 (1277)
50	43e6	/ 7553 (1277)

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

echo 990930287301268043844290701781305127266910740305203221011224117696628194867352108647019972882679138379406098037262642098387030958781515056950685458562952332773169892919541643992123964538929784087 | ecm -n -c 825 1e6

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

echo 990930287301268043844290701781305127266910740305203221011224117696628194867352108647019972882679138379406098037262642098387030958781515056950685458562952332773169892919541643992123964538929784087 | ecm -n -c 2336 3e6

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

echo 990930287301268043844290701781305127266910740305203221011224117696628194867352108647019972882679138379406098037262642098387030958781515056950685458562952332773169892919541643992123964538929784087 | ecm -n -c 4479 11e6

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

echo 990930287301268043844290701781305127266910740305203221011224117696628194867352108647019972882679138379406098037262642098387030958781515056950685458562952332773169892919541643992123964538929784087 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers