Contribution and Reservation

7·10¹⁹⁶+1 =: 7(0)₁₉₅1_<197>; = 43 · 317 · 1372963 · [3740343504479472490515528554550606468852393955614664401067010292209659255073829918281456549774990170747297067496585596574102001581384853005867903842404724145367019780504670851921501819317_<187>] SUBMIT/RESERVE

Status

Expression:	7·10¹⁹⁶+1
Composite Factor:	374034350447947249051552855455060646885239395561466440106701 029220965925507382991828145654977499017074729706749658559657 410200158138485300586790384240472414536701978050467085192150 1819317 (187-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 198.05-digit and the GNFS difficulty is 186.57-digit. SNFS must be faster than GNFS. It will take about 17 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 70001_196.
Put the following polynomial file 70001_196.poly in there too.
And then, run "perl factMsieve.pl 70001_196".

70001_196.poly ^*1

n: 3740343504479472490515528554550606468852393955614664401067010292209659255073829918281456549774990170747297067496585596574102001581384853005867903842404724145367019780504670851921501819317
m: 2000000000000000000000000000000000000000
deg: 5
c5: 35
c0: 16
skew: 0.86
type: snfs
lss: 1
rlim: 14000000
alim: 14000000
lpbr: 28
lpba: 28
mfbr: 55
mfba: 55
rlambda: 2.5
alambda: 2.5

*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 187-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	Apr 1, 2007
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 3740343504479472490515528554550606468852393955614664401067010292209659255073829918281456549774990170747297067496585596574102001581384853005867903842404724145367019780504670851921501819317 | ecm -n -c 825 1e6

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

echo 3740343504479472490515528554550606468852393955614664401067010292209659255073829918281456549774990170747297067496585596574102001581384853005867903842404724145367019780504670851921501819317 | ecm -n -c 2336 3e6

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

echo 3740343504479472490515528554550606468852393955614664401067010292209659255073829918281456549774990170747297067496585596574102001581384853005867903842404724145367019780504670851921501819317 | ecm -n -c 4479 11e6

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

echo 3740343504479472490515528554550606468852393955614664401067010292209659255073829918281456549774990170747297067496585596574102001581384853005867903842404724145367019780504670851921501819317 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers