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

Contribution and Reservation


(16·10227-1)/3 =
5(3)227<228>
= 41 · 1101419432827217431<19> · 837939824157522113713403<24> · 50951806998599951488548848592191<32> · [276623909222459955262062365246498315145753233845762190081926880984539629653558336897979021461117054738370602081856376552137256435890922353288561621777151<153>] (Serge Batalov / GMP-ECM 6.2.1 B1=3000000, sigma=2751728905 for P32 / Nov 1, 2008) SUBMIT/RESERVE

Status

Expression:(16·10227-1)/3
Composite Factor:276623909222459955262062365246498315145753233845762190081926
880984539629653558336897979021461117054738370602081856376552
137256435890922353288561621777151
(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 228.90-digit and the GNFS difficulty is 152.44-digit. GNFS must be faster than SNFS. It will take about 76 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_227.
  2. Put the following composite number file 53333_227.n in there too.
  3. And then, run "perl factMsieve.pl 53333_227".
53333_227.n
n: 276623909222459955262062365246498315145753233845762190081926880984539629653558336897979021461117054738370602081856376552137256435890922353288561621777151

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 
403e6410Serge BatalovNov 20, 2008
410 / 0  
4511e61500Serge BatalovJan 5, 2009
1500 / 4388  
/ 2888
5043e60 / 7201 (824)  
/ 7201 (824)  
5511e70 / 17672 (2987)  
/ 17672 (2987)  
6026e70 / 41993 (7602)  
/ 41993 (7602)  
Command line to find prime factors up to about 45-digit
echo 276623909222459955262062365246498315145753233845762190081926880984539629653558336897979021461117054738370602081856376552137256435890922353288561621777151 | ecm -n -c 2888 11e6
Command line to find prime factors up to about 50-digit
echo 276623909222459955262062365246498315145753233845762190081926880984539629653558336897979021461117054738370602081856376552137256435890922353288561621777151 | ecm -n -c 7201 43e6
Command line to find prime factors up to about 55-digit
echo 276623909222459955262062365246498315145753233845762190081926880984539629653558336897979021461117054738370602081856376552137256435890922353288561621777151 | ecm -n -c 17672 11e7
Command line to find prime factors up to about 60-digit
echo 276623909222459955262062365246498315145753233845762190081926880984539629653558336897979021461117054738370602081856376552137256435890922353288561621777151 | ecm -n -c 41993 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.