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

Contribution and Reservation


8·10244-1 =
7(9)244<245>
= 89 · 1278578053639<13> · 108861017508663575689495374381113<33> · 142573390866785288763609707121204263<36> · [45296210130250230198807436160507101560969066892484152346441941909506494187913106289607271581488076574862891981551400056470584444467889627923713436760753843396214751<164>] (Serge Batalov / GMP-ECM 6.2.1 B1=3000000, sigma=3441330406 for P33 / Jul 28, 2008) (Serge Batalov / GMP-ECM 6.2.1 B1=3000000, sigma=1657099395 for P36 / Jul 28, 2008) SUBMIT/RESERVE

Status

Expression:8·10244-1
Composite Factor:452962101302502301988074361605071015609690668924841523464419
419095064941879131062896072715814880765748628919815514000564
70584444467889627923713436760753843396214751
(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 246.30-digit and the GNFS difficulty is 163.66-digit. GNFS must be faster than SNFS. It will take about 259 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 79999_244.
  2. Put the following composite number file 79999_244.n in there too.
  3. And then, run "perl factMsieve.pl 79999_244".
79999_244.n
n: 45296210130250230198807436160507101560969066892484152346441941909506494187913106289607271581488076574862891981551400056470584444467889627923713436760753843396214751

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 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 
403e60 / 0  
4511e6742Serge BatalovJan 6, 2009
742 / 4437  
/ 3695
5043e60 / 7381 (1054)  
/ 7381 (1054)  
5511e70 / 17722 (3062)  
/ 17722 (3062)  
6026e70 / 42006 (7623)  
/ 42006 (7623)  
Command line to find prime factors up to about 45-digit
echo 45296210130250230198807436160507101560969066892484152346441941909506494187913106289607271581488076574862891981551400056470584444467889627923713436760753843396214751 | ecm -n -c 3695 11e6
Command line to find prime factors up to about 50-digit
echo 45296210130250230198807436160507101560969066892484152346441941909506494187913106289607271581488076574862891981551400056470584444467889627923713436760753843396214751 | ecm -n -c 7381 43e6
Command line to find prime factors up to about 55-digit
echo 45296210130250230198807436160507101560969066892484152346441941909506494187913106289607271581488076574862891981551400056470584444467889627923713436760753843396214751 | ecm -n -c 17722 11e7
Command line to find prime factors up to about 60-digit
echo 45296210130250230198807436160507101560969066892484152346441941909506494187913106289607271581488076574862891981551400056470584444467889627923713436760753843396214751 | ecm -n -c 42006 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.