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

Contribution and Reservation


(64·10233-1)/9 =
7(1)233<234>
= 3 · 99315959 · 8290079151717433488691043<25> · 244999355897374262095731654588996987803<39> · [1175096545584055105250951509988618729791632937145951352860247520445895686478618432283375088249068144836193263705482510866613839205023692202682641801126636599436267<163>] (Jo Yeong Uk / GMP-ECM 6.2.1 B1=3000000, sigma=3210162980 for P39 / Jan 3, 2009) SUBMIT/RESERVE

Status

Expression:(64·10233-1)/9
Composite Factor:117509654558405510525095150998861872979163293714595135286024
752044589568647861843228337508824906814483619326370548251086
6613839205023692202682641801126636599436267
(163-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 235.81-digit and the GNFS difficulty is 162.07-digit. GNFS must be faster than SNFS. It will take about 217 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 71111_233.
  2. Put the following composite number file 71111_233.n in there too.
  3. And then, run "perl factMsieve.pl 71111_233".
71111_233.n
n: 1175096545584055105250951509988618729791632937145951352860247520445895686478618432283375088249068144836193263705482510866613839205023692202682641801126636599436267

See also


Efforts by ECM

The efforts by ECM to find small factors of this 163-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 
403e60 / 0  
4511e6400Serge BatalovJan 6, 2009
1600Jo Yeong UkJan 29, 2009
800Jo Yeong UkApr 2, 2009
2800 / 3388  
/ 588
5043e6300Serge BatalovJan 6, 2009
300 / 6920 (468)  
/ 6620 (168)  
5511e70 / 17486 (2746)  
/ 17486 (2746)  
6026e70 / 41938 (7522)  
/ 41938 (7522)  
Command line to find prime factors up to about 45-digit
echo 1175096545584055105250951509988618729791632937145951352860247520445895686478618432283375088249068144836193263705482510866613839205023692202682641801126636599436267 | ecm -n -c 588 11e6
Command line to find prime factors up to about 50-digit
echo 1175096545584055105250951509988618729791632937145951352860247520445895686478618432283375088249068144836193263705482510866613839205023692202682641801126636599436267 | ecm -n -c 6620 43e6
Command line to find prime factors up to about 55-digit
echo 1175096545584055105250951509988618729791632937145951352860247520445895686478618432283375088249068144836193263705482510866613839205023692202682641801126636599436267 | ecm -n -c 17486 11e7
Command line to find prime factors up to about 60-digit
echo 1175096545584055105250951509988618729791632937145951352860247520445895686478618432283375088249068144836193263705482510866613839205023692202682641801126636599436267 | ecm -n -c 41938 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.