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

Contribution and Reservation


(10193+71)/9 =
(1)1929<193>
= 3 · 83 · 1431244686853<13> · 4508363445277<13> · 1413521664942116360011121415991<31> · [489241024496907354315699990163522497568807868639472158427158410636880445374402685926600142762794996201973895068523081010022271307068961<135>] (Wataru Sakai / GMP-ECM B1=10000000, sigma=3841290381 for P31) SUBMIT/RESERVE

Status

Expression:(10193+71)/9
Composite Factor:489241024496907354315699990163522497568807868639472158427158
410636880445374402685926600142762794996201973895068523081010
022271307068961
(135-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 193.00-digit and the GNFS difficulty is 134.69-digit. SNFS may be faster than GNFS. It will take about 11 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 11119_193.
  2. Put the following polynomial file 11119_193.poly in there too.
  3. And then, run "perl factMsieve.pl 11119_193".
11119_193.poly
n: 489241024496907354315699990163522497568807868639472158427158410636880445374402685926600142762794996201973895068523081010022271307068961
m: 100000000000000000000000000000000000000
deg: 5
c5: 1000
c0: 71
skew: 0.59
type: snfs
lss: 1
rlim: 11500000
alim: 11500000
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 11119_193.
  2. Put the following polynomial file 11119_193.poly in there too.
  3. And then, run "perl factMsieve.pl 11119_193".
11119_193.poly
# Murphy_E = 4.407351e-11, selected by Jeff Gilchrist
n: 489241024496907354315699990163522497568807868639472158427158410636880445374402685926600142762794996201973895068523081010022271307068961
Y0: -95032253217668712025973218
Y1: 952981437474071
c0: -1583870051330964911784359128634595
c1: 9630335309103699344367650911
c2: -4804157391762369532926
c3: -54248772405774990
c4: 10785404612
c5: 63120
skew: 644731.19
type: gnfs
# selected mechanically
rlim: 13100000
alim: 13100000
lpbr: 28
lpba: 28
mfbr: 54
mfba: 54
rlambda: 2.6
alambda: 2.6

These parameters were not fully adjusted. The approximate expressions which were used for making the parameters are: d=log10(n); time=5*10^(d/20-5)[hours]; rlim=round(3*10^(d/37+3)); lpbr=floor(d/18+21); mfbr=floor(d/5+28); rlambda=floor(d/26+21)/10;

See also


Efforts by ECM

The efforts by ECM to find small factors of this 135-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 40-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 
403e6500Erik BrangerJan 31, 2009
1850Wataru SakaiNov 29, 2009
2350 / 2350  
4511e60 / 3961  
/ 3961
5043e60 / 7465 (1129)  
/ 7465 (1129)  
5511e70 / 17751 (3097)  
/ 17751 (3097)  
6026e70 / 42014 (7636)  
/ 42014 (7636)  
Command line to find prime factors up to about 45-digit
echo 489241024496907354315699990163522497568807868639472158427158410636880445374402685926600142762794996201973895068523081010022271307068961 | ecm -n -c 3961 11e6
Command line to find prime factors up to about 50-digit
echo 489241024496907354315699990163522497568807868639472158427158410636880445374402685926600142762794996201973895068523081010022271307068961 | ecm -n -c 7465 43e6
Command line to find prime factors up to about 55-digit
echo 489241024496907354315699990163522497568807868639472158427158410636880445374402685926600142762794996201973895068523081010022271307068961 | ecm -n -c 17751 11e7
Command line to find prime factors up to about 60-digit
echo 489241024496907354315699990163522497568807868639472158427158410636880445374402685926600142762794996201973895068523081010022271307068961 | ecm -n -c 42014 26e7

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