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

Contribution and Reservation


10215-9 =
(9)2141<215>
= 1879 · 13997 · 6212923 · 21037729 · 3278149841<10> · 470412938212506827<18> · 2770137190923325144409<22> · [6809795855132386932268768058797247249564627617796635589461142175629957513836174861256364231921100789981714448952536784503183037249551735551532917<145>] SUBMIT/RESERVE

Status

Expression:10215-9
Composite Factor:680979585513238693226876805879724724956462761779663558946114
217562995751383617486125636423192110078998171444895253678450
3183037249551735551532917
(145-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 215.70-digit and the GNFS difficulty is 144.83-digit. GNFS must be faster than SNFS. It will take about 33 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_215.
  2. Put the following composite number file 99991_215.n in there too.
  3. And then, run "perl factMsieve.pl 99991_215".
99991_215.n
n: 6809795855132386932268768058797247249564627617796635589461142175629957513836174861256364231921100789981714448952536784503183037249551735551532917

See also


Efforts by ECM

The efforts by ECM to find small factors of this 145-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 45-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 
4511e62000Serge BatalovJan 9, 2009
2000 / 0  
5043e6625Serge BatalovJan 9, 2009
875Serge BatalovJan 10, 2009
674Serge BatalovJan 10, 2009
2500Markus TervoorenApr 28, 2009
190Dmitry DomanovJun 30, 2009
4864 / 7017  
/ 2153
5511e70 / 15891 (893)  
/ 15891 (893)  
6026e70 / 41413 (6835)  
/ 41413 (6835)  
6585e70 / 69284 (13416)  
/ 69284 (13416)  
Command line to find prime factors up to about 50-digit
echo 6809795855132386932268768058797247249564627617796635589461142175629957513836174861256364231921100789981714448952536784503183037249551735551532917 | ecm -n -c 2153 43e6
Command line to find prime factors up to about 55-digit
echo 6809795855132386932268768058797247249564627617796635589461142175629957513836174861256364231921100789981714448952536784503183037249551735551532917 | ecm -n -c 15891 11e7
Command line to find prime factors up to about 60-digit
echo 6809795855132386932268768058797247249564627617796635589461142175629957513836174861256364231921100789981714448952536784503183037249551735551532917 | ecm -n -c 41413 26e7
Command line to find prime factors up to about 65-digit
echo 6809795855132386932268768058797247249564627617796635589461142175629957513836174861256364231921100789981714448952536784503183037249551735551532917 | ecm -n -c 69284 85e7

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.