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

Contribution and Reservation


9·10225-1 =
8(9)225<226>
= 853 · 1049 · 55157579569<11> · 133538941942257663803<21> · 49761553125602982208933121512742791<35> · [27441694944874738547985333891331430219518293144909937468780274729274695337974413869161834959704177482590200454318554050429898051581550176667766086127396391<155>] (Makoto Kamada / GMP-ECM 6.2.1 B1=250000, sigma=894971310 for P35 / Oct 28, 2008) SUBMIT/RESERVE

Status

Expression:9·10225-1
Composite Factor:274416949448747385479853338913314302195182931449099374687802
747292746953379744138691618349597041774825902004543185540504
29898051581550176667766086127396391
(155-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 228.05-digit and the GNFS difficulty is 154.44-digit. GNFS must be faster than SNFS. It will take about 94 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 89999_225.
  2. Put the following composite number file 89999_225.n in there too.
  3. And then, run "perl factMsieve.pl 89999_225".
89999_225.n
n: 27441694944874738547985333891331430219518293144909937468780274729274695337974413869161834959704177482590200454318554050429898051581550176667766086127396391

See also


Efforts by ECM

The efforts by ECM to find small factors of this 155-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 
403e6590Serge BatalovNov 20, 2008
590 / 0  
4511e61200Serge BatalovJan 5, 2009
1000Dmitry DomanovJun 20, 2009
380Dmitry DomanovJun 22, 2009
2580 / 4348  
/ 1768
5043e60 / 6952 (504)  
/ 6952 (504)  
5511e70 / 17603 (2884)  
/ 17603 (2884)  
6026e70 / 41976 (7572)  
/ 41976 (7572)  
Command line to find prime factors up to about 45-digit
echo 27441694944874738547985333891331430219518293144909937468780274729274695337974413869161834959704177482590200454318554050429898051581550176667766086127396391 | ecm -n -c 1768 11e6
Command line to find prime factors up to about 50-digit
echo 27441694944874738547985333891331430219518293144909937468780274729274695337974413869161834959704177482590200454318554050429898051581550176667766086127396391 | ecm -n -c 6952 43e6
Command line to find prime factors up to about 55-digit
echo 27441694944874738547985333891331430219518293144909937468780274729274695337974413869161834959704177482590200454318554050429898051581550176667766086127396391 | ecm -n -c 17603 11e7
Command line to find prime factors up to about 60-digit
echo 27441694944874738547985333891331430219518293144909937468780274729274695337974413869161834959704177482590200454318554050429898051581550176667766086127396391 | ecm -n -c 41976 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.