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

Contribution and Reservation


4·10237+1 =
4(0)2361<238>
= 23 · 727 · 1699 · 4241 · 77962531 · 123866097520553272509520813<27> · 5083970348510261759335252157<28> · [676230413605955129605354486014521738526895649311989696184845947638518215716542400947488253388711090435926834770951019457366341947049456598366448537219021549936677729<165>] SUBMIT/RESERVE

Status

Expression:4·10237+1
Composite Factor:676230413605955129605354486014521738526895649311989696184845
947638518215716542400947488253388711090435926834770951019457
366341947049456598366448537219021549936677729
(165-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 237.90-digit and the GNFS difficulty is 164.83-digit. GNFS must be faster than SNFS. It will take about 294 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 40001_237.
  2. Put the following composite number file 40001_237.n in there too.
  3. And then, run "perl factMsieve.pl 40001_237".
40001_237.n
n: 676230413605955129605354486014521738526895649311989696184845947638518215716542400947488253388711090435926834770951019457366341947049456598366448537219021549936677729

See also


Efforts by ECM

The efforts by ECM to find small factors of this 165-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 
403e6300Serge BatalovNov 14, 2008
300 / 0  
4511e6500Serge BatalovJan 6, 2009
500Serge BatalovJan 10, 2009
1000Serge BatalovJan 10, 2009
2000 / 4413  
/ 2413
5043e60 / 7093 (688)  
/ 7093 (688)  
5511e70 / 17642 (2943)  
/ 17642 (2943)  
6026e70 / 41985 (7589)  
/ 41985 (7589)  
Command line to find prime factors up to about 45-digit
echo 676230413605955129605354486014521738526895649311989696184845947638518215716542400947488253388711090435926834770951019457366341947049456598366448537219021549936677729 | ecm -n -c 2413 11e6
Command line to find prime factors up to about 50-digit
echo 676230413605955129605354486014521738526895649311989696184845947638518215716542400947488253388711090435926834770951019457366341947049456598366448537219021549936677729 | ecm -n -c 7093 43e6
Command line to find prime factors up to about 55-digit
echo 676230413605955129605354486014521738526895649311989696184845947638518215716542400947488253388711090435926834770951019457366341947049456598366448537219021549936677729 | ecm -n -c 17642 11e7
Command line to find prime factors up to about 60-digit
echo 676230413605955129605354486014521738526895649311989696184845947638518215716542400947488253388711090435926834770951019457366341947049456598366448537219021549936677729 | ecm -n -c 41985 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.