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

Contribution and Reservation


(8·10209+7)/3 =
2(6)2089<210>
= 13 · 9550081 · 18516623 · 18143217664563286907<20> · 302731380806228496947769912479<30> · [21119556200761286723185485319396701440941220258895690870561676167016035330224918024311023093140782637673828982018119151827025940011693320220380067<146>] (Makoto Kamada / GMP-ECM 6.2.3 B1=1e6, sigma=467862278 / Oct 5, 2009) SUBMIT/RESERVE

Status

Expression:(8·10209+7)/3
Composite Factor:211195562007612867231854853193967014409412202588956908705616
761670160353302249180243110230931407826376738289820181191518
27025940011693320220380067
(146-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 210.60-digit and the GNFS difficulty is 145.32-digit. GNFS must be faster than SNFS. It will take about 35 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 26669_209.
  2. Put the following composite number file 26669_209.n in there too.
  3. And then, run "perl factMsieve.pl 26669_209".
26669_209.n
n: 21119556200761286723185485319396701440941220258895690870561676167016035330224918024311023093140782637673828982018119151827025940011693320220380067

See also


Efforts by ECM

The efforts by ECM to find small factors of this 146-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 35-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 
351e6118Makoto KamadaOct 14, 2009
786Wataru SakaiOct 19, 2009
904 / 904  
403e60 / 2104  
/ 2104
4511e60 / 4439 (610)  
/ 4439 (610)  
5043e60 / 7548 (1266)  
/ 7548 (1266)  
5511e70 / 17769 (3131)  
/ 17769 (3131)  
Command line to find prime factors up to about 40-digit
echo 21119556200761286723185485319396701440941220258895690870561676167016035330224918024311023093140782637673828982018119151827025940011693320220380067 | ecm -n -c 2104 3e6
Command line to find prime factors up to about 45-digit
echo 21119556200761286723185485319396701440941220258895690870561676167016035330224918024311023093140782637673828982018119151827025940011693320220380067 | ecm -n -c 4439 11e6
Command line to find prime factors up to about 50-digit
echo 21119556200761286723185485319396701440941220258895690870561676167016035330224918024311023093140782637673828982018119151827025940011693320220380067 | ecm -n -c 7548 43e6
Command line to find prime factors up to about 55-digit
echo 21119556200761286723185485319396701440941220258895690870561676167016035330224918024311023093140782637673828982018119151827025940011693320220380067 | ecm -n -c 17769 11e7

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.