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

Contribution and Reservation


10229-9 =
(9)2281<229>
= 179793157332153468293<21> · 63932480430633876497881<23> · 4392102515268294714566780119<28> · [198076438309253561849795232365833594541374500553926506867694836215975889824525581777816943842817121367207804026565527079559475898183958538727078029585103238133<159>] (Wojciech Florek) SUBMIT/RESERVE

Status

Expression:10229-9
Composite Factor:198076438309253561849795232365833594541374500553926506867694
836215975889824525581777816943842817121367207804026565527079
559475898183958538727078029585103238133
(159-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 229.00-digit and the GNFS difficulty is 158.30-digit. GNFS must be faster than SNFS. It will take about 144 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 99991_229.
  2. Put the following composite number file 99991_229.n in there too.
  3. And then, run "perl factMsieve.pl 99991_229".
99991_229.n
n: 198076438309253561849795232365833594541374500553926506867694836215975889824525581777816943842817121367207804026565527079559475898183958538727078029585103238133

See also


Efforts by ECM

The efforts by ECM to find small factors of this 159-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  
4511e61284Serge BatalovJan 6, 2009
710Dmitry DomanovJun 30, 2009
1994 / 4437  
/ 2443
5043e60 / 7100 (697)  
/ 7100 (697)  
5511e70 / 17644 (2946)  
/ 17644 (2946)  
6026e70 / 41986 (7589)  
/ 41986 (7589)  
Command line to find prime factors up to about 45-digit
echo 198076438309253561849795232365833594541374500553926506867694836215975889824525581777816943842817121367207804026565527079559475898183958538727078029585103238133 | ecm -n -c 2443 11e6
Command line to find prime factors up to about 50-digit
echo 198076438309253561849795232365833594541374500553926506867694836215975889824525581777816943842817121367207804026565527079559475898183958538727078029585103238133 | ecm -n -c 7100 43e6
Command line to find prime factors up to about 55-digit
echo 198076438309253561849795232365833594541374500553926506867694836215975889824525581777816943842817121367207804026565527079559475898183958538727078029585103238133 | ecm -n -c 17644 11e7
Command line to find prime factors up to about 60-digit
echo 198076438309253561849795232365833594541374500553926506867694836215975889824525581777816943842817121367207804026565527079559475898183958538727078029585103238133 | ecm -n -c 41986 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.