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

Contribution and Reservation


(16·10234-7)/9 =
1(7)234<235>
= 59 · 10927003 · 33186293111<11> · 138273945989<12> · 296302869461<12> · 189908256620580519399515200813<30> · [10679369021899796558786754357678893471446641067500493811560880828594753330662092669466538163791588705818162323076203196402645162047599785956803686004655362408866483<164>] (Makoto Kamada / GMP-ECM 6.2.3 B1=1e6, sigma=3444955870 for P30 / Jul 1, 2009) SUBMIT/RESERVE

Status

Expression:(16·10234-7)/9
Composite Factor:106793690218997965587867543576788934714466410675004938115608
808285947533306620926694665381637915887058181623230762031964
02645162047599785956803686004655362408866483
(164-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 235.20-digit and the GNFS difficulty is 163.03-digit. GNFS may be faster than SNFS. It will take about 242 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 17777_234.
  2. Put the following composite number file 17777_234.n in there too.
  3. And then, run "perl factMsieve.pl 17777_234".
17777_234.n
n: 10679369021899796558786754357678893471446641067500493811560880828594753330662092669466538163791588705818162323076203196402645162047599785956803686004655362408866483

See also


Efforts by ECM

The efforts by ECM to find small factors of this 164-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 
4511e64500Dmitry DomanovSep 2, 2009
4500 / 0  
5043e6500Dmitry DomanovSep 2, 2009
700Dmitry DomanovOct 25, 2009
1200 / 6438  
/ 5238
5511e70 / 17038 (2173)  
/ 17038 (2173)  
6026e70 / 41802 (7329)  
/ 41802 (7329)  
6585e70 / 69367 (13542)  
/ 69367 (13542)  
Command line to find prime factors up to about 50-digit
echo 10679369021899796558786754357678893471446641067500493811560880828594753330662092669466538163791588705818162323076203196402645162047599785956803686004655362408866483 | ecm -n -c 5238 43e6
Command line to find prime factors up to about 55-digit
echo 10679369021899796558786754357678893471446641067500493811560880828594753330662092669466538163791588705818162323076203196402645162047599785956803686004655362408866483 | ecm -n -c 17038 11e7
Command line to find prime factors up to about 60-digit
echo 10679369021899796558786754357678893471446641067500493811560880828594753330662092669466538163791588705818162323076203196402645162047599785956803686004655362408866483 | ecm -n -c 41802 26e7
Command line to find prime factors up to about 65-digit
echo 10679369021899796558786754357678893471446641067500493811560880828594753330662092669466538163791588705818162323076203196402645162047599785956803686004655362408866483 | ecm -n -c 69367 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.