Contribution and Reservation

(4·10²¹⁵-1)/3 =: 1(3)₂₁₅_<216>; = 513923 · 71078401 · [3650085461326166179708091323925864195144489564370188875782652649417215392291688293659088598154017912645725939894234530425500509346453316004739113374159686017221081396053441982475585440234356222137971271_<202>] SUBMIT/RESERVE

Status

Expression:	(4·10²¹⁵-1)/3
Composite Factor:	365008546132616617970809132392586419514448956437018887578265 264941721539229168829365908859815401791264572593989423453042 550050934645331600473911337415968601722108139605344198247558 5440234356222137971271 (202-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.

NFS

Use GGNFS and/or Msieve if GMP-ECM cannot find a factor. The SNFS difficulty of this composite number is 215.60-digit and the GNFS difficulty is 201.56-digit. SNFS must be faster than GNFS. It will take about 64 CPU-days to factor this composite number on 64-bit Opteron-2600MHz.

Steps of SNFS

Put factMsieve.pl to which $GGNFS_BIN_PATH and $NUM_CPUS were modified properly in the working directory 13333_215.
Put the following polynomial file 13333_215.poly in there too.
And then, run "perl factMsieve.pl 13333_215".

13333_215.poly

n: 3650085461326166179708091323925864195144489564370188875782652649417215392291688293659088598154017912645725939894234530425500509346453316004739113374159686017221081396053441982475585440234356222137971271
m: 200000000000000000000000000000000000
deg: 6
c6: 6250
c0: -1
skew: 0.23
type: snfs
lss: 1
rlim: 27000000
alim: 27000000
lpbr: 29
lpba: 29
mfbr: 57
mfba: 57
rlambda: 2.6
alambda: 2.6

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 202-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	700	Dmitry Domanov	Jul 11, 2009
45	11e6	700 / 699
50	43e6	1034	yoyo@home	Jan 15, 2010
		1034 / 7372
		/ 6338
55	11e7	0 / 17352 (2629)
55	11e7	/ 17352 (2629)
60	26e7	0 / 41885 (7464)
60	26e7	/ 41885 (7464)
65	85e7	0 / 69381 (13568)
65	85e7	/ 69381 (13568)

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

echo 3650085461326166179708091323925864195144489564370188875782652649417215392291688293659088598154017912645725939894234530425500509346453316004739113374159686017221081396053441982475585440234356222137971271 | ecm -n -c 6338 43e6

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

echo 3650085461326166179708091323925864195144489564370188875782652649417215392291688293659088598154017912645725939894234530425500509346453316004739113374159686017221081396053441982475585440234356222137971271 | ecm -n -c 17352 11e7

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

echo 3650085461326166179708091323925864195144489564370188875782652649417215392291688293659088598154017912645725939894234530425500509346453316004739113374159686017221081396053441982475585440234356222137971271 | ecm -n -c 41885 26e7

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

echo 3650085461326166179708091323925864195144489564370188875782652649417215392291688293659088598154017912645725939894234530425500509346453316004739113374159686017221081396053441982475585440234356222137971271 | ecm -n -c 69381 85e7

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers