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

Contribution and Reservation


(67·10179+41)/9 =
7(4)1789<180>
= 149 · 5323 · 6883 · 458333 · 8919897201656663<16> · 8831116031897972572147519<25> · [3777071631332127270537423280427393207054358724862132766526671461896161010622122150806680424000716115389641690564132751907289<124>] SUBMIT/RESERVE

Status

Expression:(67·10179+41)/9
Composite Factor:377707163133212727053742328042739320705435872486213276652667
146189616101062212215080668042400071611538964169056413275190
7289
(124-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 181.83-digit and the GNFS difficulty is 123.58-digit. GNFS must be faster than SNFS. It will take about 3 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 74449_179.
  2. Put the following composite number file 74449_179.n in there too.
  3. And then, run "perl factMsieve.pl 74449_179".
74449_179.n
n: 3777071631332127270537423280427393207054358724862132766526671461896161010622122150806680424000716115389641690564132751907289

See also


Efforts by ECM

The efforts by ECM to find small factors of this 124-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 35-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 
351e6150Lionel DebrouxNov 3, 2009
150 / 0  
403e6400Erik BrangerNov 11, 2009
400 / 2310  
/ 1910
4511e60 / 4385 (554)  
/ 4385 (554)  
5043e60 / 7537 (1250)  
/ 7537 (1250)  
5511e70 / 17766 (3127)  
/ 17766 (3127)  
Command line to find prime factors up to about 40-digit
echo 3777071631332127270537423280427393207054358724862132766526671461896161010622122150806680424000716115389641690564132751907289 | ecm -n -c 1910 3e6
Command line to find prime factors up to about 45-digit
echo 3777071631332127270537423280427393207054358724862132766526671461896161010622122150806680424000716115389641690564132751907289 | ecm -n -c 4385 11e6
Command line to find prime factors up to about 50-digit
echo 3777071631332127270537423280427393207054358724862132766526671461896161010622122150806680424000716115389641690564132751907289 | ecm -n -c 7537 43e6
Command line to find prime factors up to about 55-digit
echo 3777071631332127270537423280427393207054358724862132766526671461896161010622122150806680424000716115389641690564132751907289 | ecm -n -c 17766 11e7

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.