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

Contribution and Reservation


(58·10197+41)/9 =
6(4)1969<198>
= 13 · 933299923 · 8436592305409<13> · 111772795484434550519<21> · 5087832120754440156018956894208167<34> · [11070951636149765536840257253607829444595086747622399008620240727882623901740891490497776510088174513384413377746808577543<122>] (Serge Batalov / GMP-ECM 6.2 B1=2000000, sigma=3097237382 for P34 / Aug 8, 2009) RESERVED

Status

Expression:(58·10197+41)/9
Composite Factor:110709516361497655368402572536078294445950867476223990086202
407278826239017408914904977765100881745133844133777468085775
43
(122-digit)
Status:Not factored. Reserved by Justin Card 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 199.37-digit and the GNFS difficulty is 121.04-digit. GNFS must be faster than SNFS. It will take about 2 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 64449_197.
  2. Put the following composite number file 64449_197.n in there too.
  3. And then, run "perl factMsieve.pl 64449_197".
64449_197.n
n: 11070951636149765536840257253607829444595086747622399008620240727882623901740891490497776510088174513384413377746808577543

See also


Efforts by ECM

The efforts by ECM to find small factors of this 122-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 30-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 
3025e40 / 0  
351e6118Makoto KamadaAug 8, 2009
118 / 904  
/ 786
403e60 / 2318 (280)  
/ 2318 (280)  
4511e60 / 4475 (672)  
/ 4475 (672)  
5043e60 / 7553 (1276)  
/ 7553 (1276)  
Command line to find prime factors up to about 35-digit
echo 11070951636149765536840257253607829444595086747622399008620240727882623901740891490497776510088174513384413377746808577543 | ecm -n -c 786 1e6
Command line to find prime factors up to about 40-digit
echo 11070951636149765536840257253607829444595086747622399008620240727882623901740891490497776510088174513384413377746808577543 | ecm -n -c 2318 3e6
Command line to find prime factors up to about 45-digit
echo 11070951636149765536840257253607829444595086747622399008620240727882623901740891490497776510088174513384413377746808577543 | ecm -n -c 4475 11e6
Command line to find prime factors up to about 50-digit
echo 11070951636149765536840257253607829444595086747622399008620240727882623901740891490497776510088174513384413377746808577543 | ecm -n -c 7553 43e6

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:
(unalterable)		Justin Card
Factorization Results:
(required)
Factorization Software:
(optional)
Execution Environment:
(optional)
Reservation Key:
(required)

Cancel reservation

Name:
(unalterable)		Justin Card
Reservation Key:
(required)

Back to Factorizations of near-repdigit numbers

Copyright (C) 1999-2009 Makoto Kamada All Rights Reserved.