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

Contribution and Reservation


(8·10218+7)/3 =
2(6)2179<219>
= 307 · 89690143 · 615046225945003<15> · 14652967475174650405061<23> · 1342390712063055001925603562834767<34> · [800522159352933722050896549761388621424585536007720393498837602232681478070960919646071118994305807360849237736779454745588953403185113129<138>] (Serge Batalov / GMP-ECM 6.2.3 B1=1000000, sigma=3543900038 for P34 / Oct 16, 2009) SUBMIT/RESERVE

Status

Expression:(8·10218+7)/3
Composite Factor:800522159352933722050896549761388621424585536007720393498837
602232681478070960919646071118994305807360849237736779454745
588953403185113129
(138-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 219.20-digit and the GNFS difficulty is 137.90-digit. GNFS must be faster than SNFS. It will take about 15 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_218.
  2. Put the following composite number file 26669_218.n in there too.
  3. And then, run "perl factMsieve.pl 26669_218".
26669_218.n
n: 800522159352933722050896549761388621424585536007720393498837602232681478070960919646071118994305807360849237736779454745588953403185113129

See also


Efforts by ECM

The efforts by ECM to find small factors of this 138-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 
403e62318Wataru SakaiOct 24, 2009
2318 / 2318  
4511e60 / 3963  
/ 3963
5043e60 / 7465 (1130)  
/ 7465 (1130)  
5511e70 / 17751 (3097)  
/ 17751 (3097)  
6026e70 / 42014 (7636)  
/ 42014 (7636)  
Command line to find prime factors up to about 45-digit
echo 800522159352933722050896549761388621424585536007720393498837602232681478070960919646071118994305807360849237736779454745588953403185113129 | ecm -n -c 3963 11e6
Command line to find prime factors up to about 50-digit
echo 800522159352933722050896549761388621424585536007720393498837602232681478070960919646071118994305807360849237736779454745588953403185113129 | ecm -n -c 7465 43e6
Command line to find prime factors up to about 55-digit
echo 800522159352933722050896549761388621424585536007720393498837602232681478070960919646071118994305807360849237736779454745588953403185113129 | ecm -n -c 17751 11e7
Command line to find prime factors up to about 60-digit
echo 800522159352933722050896549761388621424585536007720393498837602232681478070960919646071118994305807360849237736779454745588953403185113129 | ecm -n -c 42014 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.