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

Contribution and Reservation


(4·10239-1)/3 =
1(3)239<240>
= 4667580867677873203<19> · 24503401321619517515329<23> · 7376676687266393712046503536607829252598737391<46> · [158037358971372761393703399726706499974585107747002750603566153342837853221986516569540101910758293615058417151095031685002002369382801730594252944626649<153>] (Dmitry Domanov / GMP-ECM 6.2.3 B1=11000000, sigma=4266053392 for P46 / Jul 8, 2009) SUBMIT/RESERVE

Status

Expression:(4·10239-1)/3
Composite Factor:158037358971372761393703399726706499974585107747002750603566
153342837853221986516569540101910758293615058417151095031685
002002369382801730594252944626649
(153-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.

GNFS

Use GGNFS and/or Msieve if GMP-ECM cannot find a factor. The SNFS difficulty of this composite number is 240.30-digit and the GNFS difficulty is 152.20-digit. GNFS must be faster than SNFS. It will take about 74 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 13333_239.
  2. Put the following composite number file 13333_239.n in there too.
  3. And then, run "perl factMsieve.pl 13333_239".
13333_239.n
n: 158037358971372761393703399726706499974585107747002750603566153342837853221986516569540101910758293615058417151095031685002002369382801730594252944626649

See also


Efforts by ECM

The efforts by ECM to find small factors of this 153-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 
403e6500suberiJul 25, 2008
500 / 145  
4511e6635Dmitry DomanovJul 8, 2009
635 / 4368  
/ 3733
5043e60 / 7392 (1065)  
/ 7392 (1065)  
5511e70 / 17726 (3066)  
/ 17726 (3066)  
6026e70 / 42007 (7625)  
/ 42007 (7625)  
Command line to find prime factors up to about 45-digit
echo 158037358971372761393703399726706499974585107747002750603566153342837853221986516569540101910758293615058417151095031685002002369382801730594252944626649 | ecm -n -c 3733 11e6
Command line to find prime factors up to about 50-digit
echo 158037358971372761393703399726706499974585107747002750603566153342837853221986516569540101910758293615058417151095031685002002369382801730594252944626649 | ecm -n -c 7392 43e6
Command line to find prime factors up to about 55-digit
echo 158037358971372761393703399726706499974585107747002750603566153342837853221986516569540101910758293615058417151095031685002002369382801730594252944626649 | ecm -n -c 17726 11e7
Command line to find prime factors up to about 60-digit
echo 158037358971372761393703399726706499974585107747002750603566153342837853221986516569540101910758293615058417151095031685002002369382801730594252944626649 | ecm -n -c 42007 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

Copyright (C) 1999-2009 Makoto Kamada All Rights Reserved.