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

Contribution and Reservation


(7·10194-61)/9 =
(7)1931<194>
= 222859081 · 159323165639442229<18> · 531491056722536956751161878516801175793<39> · [4121452578261226588134752211933914983172630935008130060283432217832558587126174695042602785911630481640122255956671055306646366103<130>] (Erik Branger / GMP-ECM B1=3000000, sigma=4288920521 for P39 / Jan 11, 2010) RESERVED

Status

Expression:(7·10194-61)/9
Composite Factor:412145257826122658813475221193391498317263093500813006028343
221783255858712617469504260278591163048164012225595667105530
6646366103
(130-digit)
Status:Not factored. Reserved by Erik Branger 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 194.85-digit and the GNFS difficulty is 129.62-digit. GNFS must be faster than SNFS. It will take about 6 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 77771_194.
  2. Put the following composite number file 77771_194.n in there too.
  3. And then, run "perl factMsieve.pl 77771_194".
77771_194.n
n: 4121452578261226588134752211933914983172630935008130060283432217832558587126174695042602785911630481640122255956671055306646366103

See also


Efforts by ECM

The efforts by ECM to find small factors of this 130-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 
403e6400Erik BrangerJan 11, 2010
1950Wataru SakaiJan 24, 2010
2350 / 2350  
4511e60 / 3961  
/ 3961
5043e60 / 7465 (1129)  
/ 7465 (1129)  
5511e70 / 17751 (3097)  
/ 17751 (3097)  
6026e70 / 42014 (7636)  
/ 42014 (7636)  
Command line to find prime factors up to about 45-digit
echo 4121452578261226588134752211933914983172630935008130060283432217832558587126174695042602785911630481640122255956671055306646366103 | ecm -n -c 3961 11e6
Command line to find prime factors up to about 50-digit
echo 4121452578261226588134752211933914983172630935008130060283432217832558587126174695042602785911630481640122255956671055306646366103 | ecm -n -c 7465 43e6
Command line to find prime factors up to about 55-digit
echo 4121452578261226588134752211933914983172630935008130060283432217832558587126174695042602785911630481640122255956671055306646366103 | ecm -n -c 17751 11e7
Command line to find prime factors up to about 60-digit
echo 4121452578261226588134752211933914983172630935008130060283432217832558587126174695042602785911630481640122255956671055306646366103 | 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:
(alterable)
Factorization Results:
(required)
Factorization Software:
(optional)
Execution Environment:
(optional)
Reservation Key:
(required)

Cancel reservation

Name:
(unalterable)		Erik Branger
Reservation Key:
(required)

Back to Factorizations of near-repdigit numbers

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