Contribution and Reservation

(16·10²²⁹-1)/3 =: 5(3)₂₂₉_<230>; = 138587157716002611881874212016797719_<36> · [384836042619661515037583365602420853804947706362741067724480589885195095790677520451016462477007474961684527089033394907416313251084718861869219905548092763513236834002103979070093897973877134707_<195>] (Serge Batalov / GMP-ECM 6.2.1 B1=1000000, sigma=2575188952 for P36 / Nov 1, 2008) SUBMIT/RESERVE

Status

Expression:	(16·10²²⁹-1)/3
Composite Factor:	384836042619661515037583365602420853804947706362741067724480 589885195095790677520451016462477007474961684527089033394907 416313251084718861869219905548092763513236834002103979070093 897973877134707 (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 230.51-digit and the GNFS difficulty is 194.59-digit. SNFS must be faster than GNFS. It will take about 201 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 53333_229.
Put the following polynomial file 53333_229.poly in there too.
And then, run "perl factMsieve.pl 53333_229".

53333_229.poly ^*1

n: 384836042619661515037583365602420853804947706362741067724480589885195095790677520451016462477007474961684527089033394907416313251084718861869219905548092763513236834002103979070093897973877134707
m: 200000000000000000000000000000000000000
deg: 6
c6: 5
c0: -2
skew: 0.86
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 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 384836042619661515037583365602420853804947706362741067724480589885195095790677520451016462477007474961684527089033394907416313251084718861869219905548092763513236834002103979070093897973877134707 | ecm -n -c 825 1e6

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

echo 384836042619661515037583365602420853804947706362741067724480589885195095790677520451016462477007474961684527089033394907416313251084718861869219905548092763513236834002103979070093897973877134707 | ecm -n -c 2336 3e6

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

echo 384836042619661515037583365602420853804947706362741067724480589885195095790677520451016462477007474961684527089033394907416313251084718861869219905548092763513236834002103979070093897973877134707 | ecm -n -c 4479 11e6

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

echo 384836042619661515037583365602420853804947706362741067724480589885195095790677520451016462477007474961684527089033394907416313251084718861869219905548092763513236834002103979070093897973877134707 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers