counterSince 16 Jun 2000STUDIO KAMADA英語 ⇒ 日本語
Home > Math > Factorizations >

Contribution and Reservation


(32·10195-23)/9 =
3(5)1943<196>
= 11 · 17 · 1019 · 11597 · 67829 · 244979073043<12> · 103006187361337566011944121049239<33> · [940022626361736428027252898323336782308056104327236273583195401942375080676203948933037333853780425271367083459258236281339248935045206101<138>] (Serge Batalov / GMP-ECM 6.2.1 B1=1000000, sigma=20430581 for P33 / Jul 14, 2008) SUBMIT/RESERVE

Status

Expression:(32·10195-23)/9
Composite Factor:940022626361736428027252898323336782308056104327236273583195
401942375080676203948933037333853780425271367083459258236281
339248935045206101
(138-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 196.51-digit and the GNFS difficulty is 137.97-digit. SNFS may be faster than GNFS. It will take about 15 CPU-days to factor this composite number on 64-bit Opteron-2600MHz.

Steps of SNFS

  1. Put factMsieve.pl to which $GGNFS_BIN_PATH and $NUM_CPUS were modified properly in the working directory 35553_195.
  2. Put the following polynomial file 35553_195.poly in there too.
  3. And then, run "perl factMsieve.pl 35553_195".
35553_195.poly
n: 940022626361736428027252898323336782308056104327236273583195401942375080676203948933037333853780425271367083459258236281339248935045206101
m: 2000000000000000000000000000000000000000
deg: 5
c5: 1
c0: -23
skew: 1.87
type: snfs
lss: 1
rlim: 13200000
alim: 13200000
lpbr: 28
lpba: 28
mfbr: 55
mfba: 55
rlambda: 2.5
alambda: 2.5

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;

Steps of GNFS

  1. Put factMsieve.pl to which $GGNFS_BIN_PATH and $NUM_CPUS were modified properly in the working directory 35553_195.
  2. Put the following composite number file 35553_195.n in there too.
  3. And then, run "perl factMsieve.pl 35553_195".
35553_195.n
n: 940022626361736428027252898323336782308056104327236273583195401942375080676203948933037333853780425271367083459258236281339248935045206101

See also


Efforts by ECM

The efforts by ECM to find small factors of this 138-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)

LevelB1Reported runs
Total / Required runs
(Required runs for lower level)
Name 
3025e40 / 0  
351e6150Lionel DebrouxDec 1, 2009
150 / 904  
/ 754
403e60 / 2310 (269)  
/ 2310 (269)  
4511e60 / 4474 (670)  
/ 4474 (670)  
5043e60 / 7553 (1276)  
/ 7553 (1276)  
Command line to find prime factors up to about 35-digit
echo 940022626361736428027252898323336782308056104327236273583195401942375080676203948933037333853780425271367083459258236281339248935045206101 | ecm -n -c 754 1e6
Command line to find prime factors up to about 40-digit
echo 940022626361736428027252898323336782308056104327236273583195401942375080676203948933037333853780425271367083459258236281339248935045206101 | ecm -n -c 2310 3e6
Command line to find prime factors up to about 45-digit
echo 940022626361736428027252898323336782308056104327236273583195401942375080676203948933037333853780425271367083459258236281339248935045206101 | ecm -n -c 4474 11e6
Command line to find prime factors up to about 50-digit
echo 940022626361736428027252898323336782308056104327236273583195401942375080676203948933037333853780425271367083459258236281339248935045206101 | ecm -n -c 7553 43e6

Submit polynomial for GNFS

Name:
(required)
Polynomial, skew and Murphy_E:
(required)
Paste the log file which includes a set of polynomial, skew and Murphy_E here.

Submit factors

Name:
(optional)
(Leave a blank or enter anonymous to withhold your name)
E-Mail:
(required)
Factorization Results:
(required)
Factorization Software:
(optional)
Execution Environment:
(optional)

Make reservation

Name:
(required)
E-Mail:
(required)
(Don't forget reservation key that appears after you click this button)

Back to Factorizations of near-repdigit numbers