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

Contribution and Reservation


(64·10299-1)/9 =
7(1)299<300>
= 32 · 2969 · 749171669900077<15> · [35522490881093271661329585252950977328355983829259008052214897789518454045113897933243449260530339391447395099565727016988435909370824675255172788569185714160986064441971067235058833766415204488845576065957814052349748433017729447724077164421499942993371676681437437118176706331683<281>] SUBMIT/RESERVE

Status

Expression:(64·10299-1)/9
Composite Factor:355224908810932716613295852529509773283559838292590080522148
977895184540451138979332434492605303393914473950995657270169
884359093708246752551727885691857141609860644419710672350588
337664152044888455760659578140523497484330177294477240771644
21499942993371676681437437118176706331683
(281-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.

SNFS

Use GGNFS and/or Msieve if GMP-ECM cannot find a factor. The SNFS difficulty of this composite number is 301.81-digit and the GNFS difficulty is 280.55-digit. SNFS must be faster than GNFS. It will take about 47862 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_299.
  2. Put the following polynomial file 71111_299.poly in there too.
  3. And then, run "perl factMsieve.pl 71111_299".
71111_299.poly *1
n: 35522490881093271661329585252950977328355983829259008052214897789518454045113897933243449260530339391447395099565727016988435909370824675255172788569185714160986064441971067235058833766415204488845576065957814052349748433017729447724077164421499942993371676681437437118176706331683
m: 200000000000000000000000000000000000000000000000000
deg: 6
c6: 1
c0: -10
skew: 1.47
type: snfs
lss: 1
rlim: 750000000
alim: 750000000
lpbr: 33
lpba: 33
mfbr: 68
mfba: 68
rlambda: 3.0
alambda: 3.0

*1 These parameters were not fully adjusted. The approximate expressions which were used for making the parameters are: deg=expt<=105?4:expt<=210?5:6 or expt<=144?4:6; d=log10(c[deg])+deg*log10(m)[digits]; time=10^(d/30-4)[hours]; skew=|c0/c[deg]|^(1/deg); rlim=round(7*10^(d/60+3)); lpbr=floor(d/25+21); mfbr=floor(d/8+31); rlambda=floor(d/25+18)/10;

See also


Efforts by ECM

The efforts by ECM to find small factors of this 281-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 BatalovJan 24, 2009
770Serge BatalovJan 26, 2009
160Serge BatalovJan 26, 2009
1330 / 0  
4511e6220Serge BatalovJan 26, 2009
130Serge BatalovJan 26, 2009
236Serge BatalovJan 27, 2009
500Serge BatalovAug 20, 2009
1086 / 4186  
/ 3100
5043e60 / 7259 (884)  
/ 7259 (884)  
5511e70 / 17691 (3012)  
/ 17691 (3012)  
6026e70 / 41998 (7610)  
/ 41998 (7610)  
Command line to find prime factors up to about 45-digit
echo 35522490881093271661329585252950977328355983829259008052214897789518454045113897933243449260530339391447395099565727016988435909370824675255172788569185714160986064441971067235058833766415204488845576065957814052349748433017729447724077164421499942993371676681437437118176706331683 | ecm -n -c 3100 11e6
Command line to find prime factors up to about 50-digit
echo 35522490881093271661329585252950977328355983829259008052214897789518454045113897933243449260530339391447395099565727016988435909370824675255172788569185714160986064441971067235058833766415204488845576065957814052349748433017729447724077164421499942993371676681437437118176706331683 | ecm -n -c 7259 43e6
Command line to find prime factors up to about 55-digit
echo 35522490881093271661329585252950977328355983829259008052214897789518454045113897933243449260530339391447395099565727016988435909370824675255172788569185714160986064441971067235058833766415204488845576065957814052349748433017729447724077164421499942993371676681437437118176706331683 | ecm -n -c 17691 11e7
Command line to find prime factors up to about 60-digit
echo 35522490881093271661329585252950977328355983829259008052214897789518454045113897933243449260530339391447395099565727016988435909370824675255172788569185714160986064441971067235058833766415204488845576065957814052349748433017729447724077164421499942993371676681437437118176706331683 | ecm -n -c 41998 26e7

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