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

Contribution and Reservation


(16·10181-1)/3 =
5(3)181<182>
= 107 · 381401 · [1306872209567479125432295970028388776610868859204539067764436055522825213331981700750588168047854981226331472241123542215701038802497965342908851356444731259332037520529839319<175>] SUBMIT/RESERVE

Status

Expression:(16·10181-1)/3
Composite Factor:130687220956747912543229597002838877661086885920453906776443
605552282521333198170075058816804785498122633147224112354221
5701038802497965342908851356444731259332037520529839319
(175-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 182.20-digit and the GNFS difficulty is 174.12-digit. SNFS must be faster than GNFS. It will take about 5 CPU-days to factor this composite number on 64-bit Opteron-2600MHz.

  1. Put factMsieve.pl to which $GGNFS_BIN_PATH and $NUM_CPUS were modified properly in the working directory 53333_181.
  2. Put the following polynomial file 53333_181.poly in there too.
  3. And then, run "perl factMsieve.pl 53333_181".
53333_181.poly *1
n: 1306872209567479125432295970028388776610868859204539067764436055522825213331981700750588168047854981226331472241123542215701038802497965342908851356444731259332037520529839319
m: 2000000000000000000000000000000000000
deg: 5
c5: 5
c0: -1
skew: 0.72
type: snfs
lss: 1
rlim: 7600000
alim: 7600000
lpbr: 28
lpba: 28
mfbr: 53
mfba: 53
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;

See also


Efforts by ECM

The efforts by ECM to find small factors of this 175-digit composite number are not reported yet. Please report your efforts by ECM. (Anonymous reports are not acceptable)

LevelB1Reported runs
Total / Required runs
(Required runs for lower level)
Name 
2011e30 / 74  
/ 74
255e40 / 214 (21)  
/ 214 (21)  
3025e40 / 430 (50)  
/ 430 (50)  
351e60 / 904 (118)  
/ 904 (118)  
403e60 / 2350 (322)  
/ 2350 (322)  
Command line to find prime factors up to about 20-digit
echo 1306872209567479125432295970028388776610868859204539067764436055522825213331981700750588168047854981226331472241123542215701038802497965342908851356444731259332037520529839319 | ecm -n -c 74 11e3
Command line to find prime factors up to about 25-digit
echo 1306872209567479125432295970028388776610868859204539067764436055522825213331981700750588168047854981226331472241123542215701038802497965342908851356444731259332037520529839319 | ecm -n -c 214 5e4
Command line to find prime factors up to about 30-digit
echo 1306872209567479125432295970028388776610868859204539067764436055522825213331981700750588168047854981226331472241123542215701038802497965342908851356444731259332037520529839319 | ecm -n -c 430 25e4
Command line to find prime factors up to about 35-digit
echo 1306872209567479125432295970028388776610868859204539067764436055522825213331981700750588168047854981226331472241123542215701038802497965342908851356444731259332037520529839319 | ecm -n -c 904 1e6
Command line to find prime factors up to about 40-digit
echo 1306872209567479125432295970028388776610868859204539067764436055522825213331981700750588168047854981226331472241123542215701038802497965342908851356444731259332037520529839319 | ecm -n -c 2350 3e6

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