Contribution and Reservation

(16·10²³¹-7)/9 =: 1(7)₂₃₁_<232>; = 23 · 263 · [293896144449954997152881100641060965081464337539721900773314230083944086258518396061791664370603038151393251409783067908377876967726529637589316875149244135853492771991697433919288771330431108906890027736448632464502856303153873_<228>] SUBMIT/RESERVE

Status

Expression:	(16·10²³¹-7)/9
Composite Factor:	293896144449954997152881100641060965081464337539721900773314 230083944086258518396061791664370603038151393251409783067908 377876967726529637589316875149244135853492771991697433919288 771330431108906890027736448632464502856303153873 (228-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 232.20-digit and the GNFS difficulty is 227.47-digit. SNFS must be faster than GNFS. It will take about 229 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 17777_231.
Put the following polynomial file 17777_231.poly in there too.
And then, run "perl factMsieve.pl 17777_231".

17777_231.poly ^*1

n: 293896144449954997152881100641060965081464337539721900773314230083944086258518396061791664370603038151393251409783067908377876967726529637589316875149244135853492771991697433919288771330431108906890027736448632464502856303153873
m: 200000000000000000000000000000000000000
deg: 6
c6: 250
c0: -7
skew: 0.55
type: snfs
lss: 1
rlim: 52000000
alim: 52000000
lpbr: 30
lpba: 30
mfbr: 60
mfba: 60
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 228-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 45-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
45	11e6	4500	Dmitry Domanov	Sep 2, 2009
45	11e6	4500 / 3839
50	43e6	0 / 6436
50	43e6	/ 6436
55	11e7	0 / 17466 (2670)
55	11e7	/ 17466 (2670)
60	26e7	0 / 41942 (7513)
60	26e7	/ 41942 (7513)
65	85e7	0 / 69396 (13587)
65	85e7	/ 69396 (13587)

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

echo 293896144449954997152881100641060965081464337539721900773314230083944086258518396061791664370603038151393251409783067908377876967726529637589316875149244135853492771991697433919288771330431108906890027736448632464502856303153873 | ecm -n -c 6436 43e6

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

echo 293896144449954997152881100641060965081464337539721900773314230083944086258518396061791664370603038151393251409783067908377876967726529637589316875149244135853492771991697433919288771330431108906890027736448632464502856303153873 | ecm -n -c 17466 11e7

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

echo 293896144449954997152881100641060965081464337539721900773314230083944086258518396061791664370603038151393251409783067908377876967726529637589316875149244135853492771991697433919288771330431108906890027736448632464502856303153873 | ecm -n -c 41942 26e7

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

echo 293896144449954997152881100641060965081464337539721900773314230083944086258518396061791664370603038151393251409783067908377876967726529637589316875149244135853492771991697433919288771330431108906890027736448632464502856303153873 | ecm -n -c 69396 85e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers