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

Contribution and Reservation


(43·10245-7)/9 =
4(7)245<246>
= 32 · 53598747618551486853933977572595599339<38> · 27976147881343907065273464547470440058178217281<47> · [35403066396506894069278844750214201009889285722256175087036574343440723864063382620752845855264935086210428287407910294761124301971887380413930153470653666732667<161>] (Serge Batalov / GMP-ECM 6.2.1 B1=3000000, sigma=45451499 for P38 / Jan 28, 2009) SUBMIT/RESERVE

Status

Expression:(43·10245-7)/9
Composite Factor:354030663965068940692788447502142010098892857222561750870365
743434407238640633826207528458552649350862104282874079102947
61124301971887380413930153470653666732667
(161-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 247.63-digit and the GNFS difficulty is 160.55-digit. GNFS must be faster than SNFS. It will take about 184 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 47777_245.
  2. Put the following composite number file 47777_245.n in there too.
  3. And then, run "perl factMsieve.pl 47777_245".
47777_245.n
n: 35403066396506894069278844750214201009889285722256175087036574343440723864063382620752845855264935086210428287407910294761124301971887380413930153470653666732667

See also


Efforts by ECM

The efforts by ECM to find small factors of this 161-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 
403e6356Serge BatalovJan 29, 2009
356 / 0  
4511e6400Serge BatalovJan 29, 2009
20Serge BatalovJan 29, 2009
800Serge BatalovFeb 1, 2009
570Serge BatalovFeb 1, 2009
1790 / 4400  
/ 2610
5043e60 / 7138 (744)  
/ 7138 (744)  
5511e70 / 17655 (2961)  
/ 17655 (2961)  
6026e70 / 41989 (7594)  
/ 41989 (7594)  
Command line to find prime factors up to about 45-digit
echo 35403066396506894069278844750214201009889285722256175087036574343440723864063382620752845855264935086210428287407910294761124301971887380413930153470653666732667 | ecm -n -c 2610 11e6
Command line to find prime factors up to about 50-digit
echo 35403066396506894069278844750214201009889285722256175087036574343440723864063382620752845855264935086210428287407910294761124301971887380413930153470653666732667 | ecm -n -c 7138 43e6
Command line to find prime factors up to about 55-digit
echo 35403066396506894069278844750214201009889285722256175087036574343440723864063382620752845855264935086210428287407910294761124301971887380413930153470653666732667 | ecm -n -c 17655 11e7
Command line to find prime factors up to about 60-digit
echo 35403066396506894069278844750214201009889285722256175087036574343440723864063382620752845855264935086210428287407910294761124301971887380413930153470653666732667 | ecm -n -c 41989 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.