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

Contribution and Reservation


2·10214-1 =
1(9)214<215>
= 7 · 17 · 79396251305573567<17> · 90288233488896424057<20> · 38115909555433345954531231<26> · [615099809895091898670886860215714256707251973200636112364342237811652291980354324592432834671548674627742658656305609268579024525475061012264371017889<150>] SUBMIT/RESERVE

Status

Expression:2·10214-1
Composite Factor:615099809895091898670886860215714256707251973200636112364342
237811652291980354324592432834671548674627742658656305609268
579024525475061012264371017889
(150-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 149.79-digit. GNFS may be faster than SNFS. It will take about 57 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 19999_214.
  2. Put the following composite number file 19999_214.n in there too.
  3. And then, run "perl factMsieve.pl 19999_214".
19999_214.n
n: 615099809895091898670886860215714256707251973200636112364342237811652291980354324592432834671548674627742658656305609268579024525475061012264371017889

See also


Efforts by ECM

The efforts by ECM to find small factors of this 150-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 
403e6400Serge BatalovMay 19, 2009
400 / 0  
4511e61000Dmitry DomanovJun 20, 2009
1000 / 4387  
/ 3387
5043e60 / 7313 (966)  
/ 7313 (966)  
5511e70 / 17704 (3034)  
/ 17704 (3034)  
6026e70 / 42001 (7615)  
/ 42001 (7615)  
Command line to find prime factors up to about 45-digit
echo 615099809895091898670886860215714256707251973200636112364342237811652291980354324592432834671548674627742658656305609268579024525475061012264371017889 | ecm -n -c 3387 11e6
Command line to find prime factors up to about 50-digit
echo 615099809895091898670886860215714256707251973200636112364342237811652291980354324592432834671548674627742658656305609268579024525475061012264371017889 | ecm -n -c 7313 43e6
Command line to find prime factors up to about 55-digit
echo 615099809895091898670886860215714256707251973200636112364342237811652291980354324592432834671548674627742658656305609268579024525475061012264371017889 | ecm -n -c 17704 11e7
Command line to find prime factors up to about 60-digit
echo 615099809895091898670886860215714256707251973200636112364342237811652291980354324592432834671548674627742658656305609268579024525475061012264371017889 | ecm -n -c 42001 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.