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

Contribution and Reservation


(4·10231-1)/3 =
1(3)231<232>
= 2917 · 51824844853<11> · 23692560197239551081270833387477<32> · 1862546921637290351531952691671776489<37> · [199868835314352006303616101691173511035981142016504847269115886853153738185472417870991193724827260514112019164316369241384478739018564658717340450161<150>] (Serge Batalov / GMP-ECM 6.2 B1=1000000, sigma=330100060 for P32 / Jul 11, 2008) (Dmitry Domanov / ECMNET for P37 / Jul 1, 2009) SUBMIT/RESERVE

Status

Expression:(4·10231-1)/3
Composite Factor:199868835314352006303616101691173511035981142016504847269115
886853153738185472417870991193724827260514112019164316369241
384478739018564658717340450161
(150-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.

NFS

Use GGNFS and/or Msieve if GMP-ECM cannot find a factor. The SNFS difficulty of this composite number is 231.60-digit and the GNFS difficulty is 149.30-digit. GNFS must be faster than SNFS. It will take about 61 CPU-days to factor this composite number on 64-bit Opteron-2600MHz.

Steps of GNFS

  1. Put factMsieve.pl to which $GGNFS_BIN_PATH and $NUM_CPUS were modified properly in the working directory 13333_231.
  2. Put the following composite number file 13333_231.n in there too.
  3. And then, run "perl factMsieve.pl 13333_231".
13333_231.n
n: 199868835314352006303616101691173511035981142016504847269115886853153738185472417870991193724827260514112019164316369241384478739018564658717340450161

See also


Efforts by ECM

The efforts by ECM to find small factors of this 150-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 45-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 
4511e6700Dmitry DomanovJul 11, 2009
3668Wataru SakaiJan 7, 2010
4368 / 699  
5043e61046yoyo@homeJan 15, 2010
1046 / 6554  
/ 5508
5511e70 / 17119 (2285)  
/ 17119 (2285)  
6026e70 / 41825 (7364)  
/ 41825 (7364)  
6585e70 / 69372 (13549)  
/ 69372 (13549)  
Command line to find prime factors up to about 50-digit
echo 199868835314352006303616101691173511035981142016504847269115886853153738185472417870991193724827260514112019164316369241384478739018564658717340450161 | ecm -n -c 5508 43e6
Command line to find prime factors up to about 55-digit
echo 199868835314352006303616101691173511035981142016504847269115886853153738185472417870991193724827260514112019164316369241384478739018564658717340450161 | ecm -n -c 17119 11e7
Command line to find prime factors up to about 60-digit
echo 199868835314352006303616101691173511035981142016504847269115886853153738185472417870991193724827260514112019164316369241384478739018564658717340450161 | ecm -n -c 41825 26e7
Command line to find prime factors up to about 65-digit
echo 199868835314352006303616101691173511035981142016504847269115886853153738185472417870991193724827260514112019164316369241384478739018564658717340450161 | ecm -n -c 69372 85e7

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.